Independent spanning trees with small depths in iterated line digraphs

We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line digraphs. From the results, we can obtain independent spanning trees with small depths in de Bruijn and Kautz digraphs that improve the previously known upper bounds on the depths.     

Super Connectivity of Line Graphs and Digraphs

The h-super connectivity κh and the h-super edge-connectivity λh are more refined network reliability indices than the conneetivity and the edge-connectivity. This paper shows that for a connected balanced digraph D and its line digraph L, if D is optimally super edge-connected, then κ1（L） = 2λ1 （D）, and that for a connected graph G and its line graph L, if one of κ1 （L） and λ（G） exists, then κ1（L） = λ2（G）. This paper determines that κ1（B（d, n） is equal to 4d- 8 for n = 2 and d ≥ 4, and to 4d-4 for n ≥ 3 and d ≥ 3, and that κ1（K（d, n）） is equal to 4d- 4 for d 〉 2 and n ≥ 2 except K（2, 2）. It then follows that B（d,n） and K（d, n） are both super connected for any d ≥ 2 and n ≥ 1.     

Hamiltonicity of large generalized de Bruijn cycles

In this article, we determine when the large generalized de Bruijn cycles are Hamiltonian. These digraphs have been introduced by Gómez, Padró and Pérennes as large interconnection networks with small diameter and they are a family of generalized cycles. They are Kronecker products of generalized de Bruijn digraphs and dicycles.     

Edge-bipancyclicity of a hypercube with faulty vertices and edges

A bipartite graph G=(V,E) is said to be bipancyclic if it contains a cycle of every even length from 4 to |V|. Furthermore, a bipancyclic G is said to be edge-bipancyclic if every edge of G lies on a cycle of every even length. Let F_v (respectively, F_e) be the set of faulty vertices (respectively, faulty edges) in an n-dimensional hypercube Q_n. In this paper, we show that every edge of Q_n-F_v-F_e lies on a cycle of every even length from 4 to 2ⁿ-2|F_v| even if |F_v|+|F_e|?n-2, where n?3. Since Q_n is bipartite of equal-size partite sets and is regular of vertex-degree n, both the number of faults tolerated and the length of a longest fault-free cycle obtained are worst-case optimal.     

HAMILTONIAN CYCLES AND DECOMPOSITIONS OFCAYLEY DIGRAPHS OF FINITE ABELIAN GROUPS

In this paper, Hamiltonian cycles and decompositions of Cayley digraphs are investigat-ed. Sufficient conditions are given for these two problems respectively. Furthermore, the conditions are also necesaary for 2-regular Cayley disraphs, In addition, some known results about theCartesian products of two directed cycles are also deduced.     

Connectivity and separating sets of cages

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraph G[S] has diameter at least ⌊g/2⌋, with equality only when distance ⌊g/2⌋ occurs for at least two pairs of vertices in G[S]. This structural property is used to prove that every (k; g)-cage with k ≥ 3 is 3-connected. This result supports the conjecture of Fu, Huang, and Rodger that every (k; g)-cage is k-connected. A nonseparating g-cycle C in a graph G is a cycle of length g such that G − V(C) is connected. We prove that every (k; g)-cage contains a nonseparating g-cycle. For even g, we prove that every g-cycle in a (k; g)-cage is nonseparating. © 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 35–44, 1998     

关于3连通图的容错直径和宽直径

容错直径和宽直径是度量网络可靠性和有效性的重要参数．对任意k连通图，它的容错直径Dk不超过宽直径dk,本证明：当D2=2时，d3≤max{D， l，2D3-2}；当D2≥3时，d3≤(D2-1)[2(D2-1)(D3-1)-D2-2] 1．     

Chains of Modular Elements and Lattice Connectivity

We show that the order complex of any finite lattice with a chain of modular elements is at least (r−2)-connected. The first author was supported during part of this work by a postdoctoral fellowship from the Mathematical Sciences Research Institute. The second author was supported by NSF grant DMS-0300483.     

On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks

It is shown in this work that all n-dimensional hypercube networks for n ? 4 are maximally 3-restricted edge connected. Employing this observation, we analyze the reliability of hypercube networks and determine the first 3n − 5 coefficients of the reliability polynomial of n-cube networks.     

树的变形与代数连通度

本文利用瓶颈矩阵的Perron值和代数连通度的二次型形式,系统地研究了当迁移或改变分支(边、点)和变动一些边的权重时无向赋权树的代数连通度的变化规律,认为代数连通度可用来描述树的边及其权重的某种中心趋势性.引入广义树和广义特征点概念,将II型树转换成具有相同代数连通度的I型树,使得树的代数连通度的讨论只须限于I型树的研究即可.     

HSAGA and its application for the construction of near-Moore digraphs

The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This paper deals with directed graphs. General upper bounds, called Moore bounds, exist for the largest possible order of such digraphs of maximum degree d and given diameter k. It is known that simulated annealing and genetic algorithm are effective techniques to identify global optimal solutions.This paper describes our attempt to build a Hybrid Simulated Annealing and Genetic Algorithm (HSAGA) that can be used to construct large digraphs. We present our new results obtained by HSAGA, as well as several related open problems.     

Connectivity of Level Sets of Quadratic Forms and Hausdorff-Toeplitz Type Theorems

Main theorem: for an arbitrary linear operator A : X X in a complex pre-Hilbert space X, dim X 3, all level sets { x X : = ,x = 1} are connected. This fails if dim X=2 and int W(A) where W(A) is the numerical range. The main theorem implies the known result on convexity of generalized numerical range of three Hermitian operators.     

On the product of projectors and generalized inverses

We consider generalized inverses of linear operators on arbitrary vector spaces and study the question when their product in reverse order is again a generalized inverse. This problem is equivalent to the question when the product of two projectors is again a projector, and we discuss necessary and sufficient conditions in terms of their kernels and images alone. We give a new representation of the product of generalized inverses that does not require explicit knowledge of the factors. Our approach is based on implicit representations of subspaces via their orthogonals in the dual space. For Fredholm operators, the corresponding computations reduce to finite-dimensional problems. We illustrate our results with examples for matrices and linear ordinary boundary problems.     

Embedding cycles of various lengths into star graphs with both edge and vertex faults

The n-dimensional star graph S_n is an attractive alternative to the hypercube graph and is a bipartite graph with two partite sets of equal size. Let F_v and F_e be the sets of faulty vertices and faulty edges of S_n, respectively. We prove that S_n − F_v − F_e contains a fault-free cycle of every even length from 6 to n! − 2∣F_v∣ with ∣F_v∣ + ∣F_e∣ ? n − 3 for every n ? 4. We also show that S_n − F_v − F_e contains a fault-free path of length n! − 2∣F_v∣ − 1 (respectively, n! − 2∣F_v∣ − 2) between two arbitrary vertices of S_n in different partite sets (respectively, the same partite set) with ∣F_v∣ + ∣F_e∣ ? n − 3 for every n ? 4.     

Capacity and flow assignment of data networks by generalized Benders decomposition

A mixed-integer non-linear model is proposed to optimize jointly the assignment of capacities and flows (the CFA problem) in a communication network. Discrete capacities are considered and the cost function combines the installation cost with a measure of the Quality of Service (QoS) of the resulting network for a given traffic. Generalized Benders decomposition induces convex subproblems which are multicommodity flow problems on different topologies with fixed capacities. These are solved by an efficient proximal decomposition method. Numerical tests on small to medium-size networks show the ability of the decomposition approach to obtain global optimal solutions of the CFA problem.     

Containment properties of product and power graphs

In this paper, we study containment properties of graphs in relation with the Cartesian product operation. These results can be used to derive embedding results for interconnection networks for parallel architectures.First, we show that the isomorphism of two Cartesian powers G^r and H^r implies the isomorphism of G and H, while G^r⊆H^r does not imply G⊆H, even for the special cases when G and H are prime, and when they are connected and have the same number of nodes at the same time.Then, we find a simple sufficient condition under which the containment of products implies the containment of the factors: if , where all graphs G_i are connected and no graph H_j has 4-cycles, then each G_i is a subgraph of a different graph H_j. Hence, if G is connected and H has no 4-cycles, then G^r⊆H^r implies G⊆H.Finally, we focus on the particular case of products of graphs with the linear array. We show that the fact that G×L_n⊆H×L_n does not imply that G⊆H even in the case when G and H are connected and have the same number of nodes. However, we find a sufficient condition under which G×L_n⊆H×L_n implies G⊆H.     

Towards the generalized purely wild inertia conjecture for product of alternating and symmetric groups

We obtain new evidence for the Purely Wild Inertia Conjecture posed by Abhyankar and for its generalization. We show that this generalized conjecture is true for any product of simple Alternating groups in odd characteristics, and for any product of certain Symmetric or Alternating groups in characteristic two. We also obtain important results towards the realization of the inertia groups which can be applied to more general set up. We further show that the Purely Wild Inertia Conjecture is true for any product of perfect quasi p-groups (groups generated by their Sylow p-subgroups) if the conjecture is established for individual groups.