Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs

A graph has spread (m, k, l) if for any m+1 distinct nodes x, y/sub 1/, . . ., y/sub m/ and m positive integers r/sub 1/, . . ., r/sub m/, such that Sigma /sub i/r/sub i/=k, there exist k node-disjoint paths of length at most 1 from x to the y/sub i/, where r/sub i/ of them end at y/sub i/. This concept contains, and is related to many important concepts used in communications and graph theory. The authors prove an optimal general theorem about the spreads of digraphs generated by line digraph iterations. Useful graphs, like the de Bruijn and Kautz digraphs, can be thus generated. The theorem is applied to the de Bruijn and Kautz digraphs to derive optimal bounds on their spreads, which implies previous results and resolves open questions on their connectivity, diameter, k-diameter, vulnerability, and some other measures related to length-bound disjoint paths. >

[1]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

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

[3]  Ding-Zhu Du,et al.  Line Digraph Iterations and Spread Concept - with Application to Graph Theory, Fault Tolerance, and Routing , 1991, WG.

[4]  R. Z. Norman,et al.  Some properties of line digraphs , 1960 .

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

[6]  Yuh-Dauh Lyuu,et al.  Fast fault-tolerant parallel communication for de Bruijn networks using information dispersal , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[7]  Makoto Imase,et al.  Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.

[8]  Frank Harary,et al.  Distance in graphs , 1990 .

[9]  Dhiraj K. Pradhan,et al.  The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[10]  Gary Chartrand,et al.  The connectivity of line-graphs , 1969 .

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

[12]  F. Boesch.  Synthesis of reliable networks - a survey , 1986, IEEE Transactions on Reliability.

[13]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[14]  Dhiraj K. Pradhan,et al.  A Fault-Tolerant Communication Architecture for Distributed Systems , 1982, IEEE Transactions on Computers.

[15]  Bernard Elspas,et al.  Topological constraints on interconnection-limited logic , 1964, SWCT.

[16]  S. Louis Hakimi,et al.  Fault-Tolerant Routing in DeBruijn Comrnunication Networks , 1985, IEEE Transactions on Computers.

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

[18]  Dhiraj K. Pradhan,et al.  Flip-Trees: Fault-Tolerant Graphs with Wide Containers , 1988, IEEE Trans. Computers.

[19]  Yuh-Dauh Lyuu,et al.  A graph-theoretical study of transmission delay and fault tolerance , 1994 .

[20]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[21]  Ivan Hal Sudborough,et al.  Three disjoint path paradigms in star networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.