Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.     

Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

Optimal Planar Interception with Fixed End Conditions: Approximate Solutions

In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper.     

Colloidal ZnO nanostructures and functional coatings: A survey

The past research work devoted to ZnO nanocolloidal sol-gel route is reviewed. It highlights the cluster chemistry of alcoholic ZnAc₂ solutions and the results of ZnO colloid growth investigations performed worldwide. Moreover, the role of doping and co-doping in the processing of functional ZnO coatings is discussed. The possibilities of tuning the optical properties are also reported with a particular attention to luminescence. The last part of this paper deals with electrical and photoelectrochemical properties of ZnO nanocrystals and their aggregates. This contribution is dedicated to the 80th birthday of Prof. Arnim Henglein from the Hahn-Meitner-Institut in Berlin and to the memory of Prof. Jacques Mugnier from the Université Claude-Bernard Lyon 1 in France.     

Synthesis and chiroptical properties of two new planar-chiral macrocycles

Could simple intraannular-arm macrocyclic systems exist in enantiopure stable forms? The effective synthesis of two representative compounds of such a class, their resolution into enantiomers, and experiments justifying their stability toward racemization are presented.     

矩阵对角相似的图论判别法

本文证明了任意两个ｎ阶复矩阵Ａ和Ｂ为对角相似的充要条件是：它们有相同的伴随有向图，并且以此有向图为基础有向图，以Ａ和Ｂ的对应非零元素比值为弧权值的赋权有向图满足“无向圈平衡条件”。我们还给出了矩阵对角相似条件在非负矩阵谱理论研究中的一个应用。     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

Loss in a rectangular optical waveguide induced by the crossover of a second waveguide

We calculate the loss induced in a single-mode rectangular optical waveguide by the presence of a second waveguide, perpendicular to the first, which crosses over the first waveguide at a variable distance d. Our calculation is applied to the analysis of several doped silica waveguides of practical importance for optical circuit design.     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.