Transmission fault-tolerance of iterated line digraphs

The main result of this paper states that, if every cyclic modification of a d-regular digraph has super line-connectivity d, then the line digraph also has super line-connectivity d. Since many well-known interconnection network topologies, such as the Kautz digraphs, the de Bruijn digraphs, etc., can be constructed by iterating the line digraph construction, our result leads to several known and new connectivity results for these topologies, as shown later in the paper.

[1]  Miguel Angel Fiol,et al.  Maximally connected digraphs , 1989, J. Graph Theory.

[2]  Paz Morillo,et al.  Diameter vulnerability of iterated line digraphs , 1996, Discret. Math..

[3]  Makoto Imase,et al.  Fault-tolerant processor interconnection networks , 1986, Systems and Computers in Japan.

[4]  de Ng Dick Bruijn.  A combinatorial problem , 1946 .

[5]  Weili Wu,et al.  Super link-connectivity of iterated line digraphs , 2003, Theor. Comput. Sci..

[6]  Carles Padró,et al.  Disjoint paths of bounded length in large generalized cycles , 1999 .

[7]  Miguel Angel Fiol,et al.  Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.

[8]  Makoto Imase,et al.  A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.

[9]  Paz Morillo,et al.  Diameter-vulnerability of Large Bipartite Digraphs , 1996, Discret. Appl. Math..

[10]  Terunao Soneoka,et al.  Super Edge-Connectivity of Dense Digraphs and Graphs , 1992, Discret. Appl. Math..

[11]  Carles Padró,et al.  Disjoint paths of bounded length in large generalized cycles , 1999, Discret. Math..

[12]  Sudhakar M. Reddy,et al.  A Class of Graphs for Fault-Tolerant Processor Interconnections , 1984, ICDCS.

[13]  Makoto Imase,et al.  Design to Minimize Diameter on Building-Block Network , 1981, IEEE Transactions on Computers.

[14]  Bernard Elspas,et al.  THEORY OF CELLULAR LOGIC NETWORKS AND MACHINES. , 1968 .

[15]  Camino Balbuena,et al.  On the superconnectivity of generalized p-cycles , 2002, Discret. Math..

[16]  Ding-Zhu Du,et al.  Generalized de Bruijn digraphs , 1988, Networks.

[17]  Ding-Zhu Du,et al.  Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs , 1993, IEEE Trans. Computers.

[18]  Ding-Zhu Du,et al.  LINE DIGRAPH ITERATIONS AND DIAMETER VULNERABILITY , 1999 .

[19]  M. A. Fiol,et al.  Dense bipartite digraphs , 1990, J. Graph Theory.

[20]  D. Frank Hsu,et al.  Super line-connectivity of consecutive-d digraphs , 1998, Discret. Math..

[21]  Claudine Peyrat,et al.  Connectivity of Imase and Itoh Digraphs , 1988, IEEE Trans. Computers.

[22]  Claude Kaiser,et al.  Distributed computing systems , 1986 .

[23]  Jean-Claude Bermond,et al.  Large fault-tolerant interconnection networks , 1989, Graphs Comb..