Super link-connectivity of iterated line digraphs

Many interconnection networks can be constructed with line digraph iterations. A digraph has super link-connectivity d if it has link-connectivity d and every link-cut of cardinality d consists of either all out-links coming from a node, or all in-links ending at a node, excluding loop. In this paper, we show that the link-digraph iteration preserves super link-connectivity.

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

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

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

[4]  Josep M. Brunat,et al.  Endo-circulant digraphs: connectivity and generalized cycles , 1999, Discret. Math..

[5]  Qiao Li,et al.  Super edge connectivity properties of connected edge symmetric graphs , 1999, Networks.

[6]  Carles Padró,et al.  Large Generalized Cycles , 1998, Discret. Appl. Math..

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

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

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

[10]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

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

[12]  Miguel Angel Fiol,et al.  Cayley Digraphs from Complete Generalized Cycles , 1999, Eur. J. Comb..

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

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

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

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

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

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

[19]  F. Boesch,et al.  Super line-connectivity properties of circulant graphs , 1986 .

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

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