On connectivity of consecutive-d digraphs

The concept of a consecutive-d digraph was proposed by Du, Hsu and Hwang as a generalization of de Bruijn digraphs, Kautz digraphs, and their generalizations given by Imase and Itoh and Reddy, Pradhan and Kuhl. In this paper, we determine the connectivity of consecutive-d digraphs and study how to modify consecutive-d digraphs to reach maximum connectivity. Our results will generalize and improve several existing results on the connectivity of de Bruijn digraphs, Kautz digraphs and Imase-Itoh digraphs.

[1]  Ding-Zhu Du,et al.  On Hamiltonian consecutive-d digraphs , 1989 .

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

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

[4]  Jean-Claude Bermond,et al.  Connectivity of kautz networks , 1993, Discret. Math..

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

[6]  Ding-Zhu Du,et al.  Doubly Linked Ring Networks , 1985, IEEE Transactions on Computers.

[7]  Ding-Zhu Du,et al.  Modification of consecutive-d digraphs , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[8]  Ding-Zhu Du,et al.  The Hamiltonian property of consecutive-d digraphs , 1993 .

[9]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

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

[11]  Ding-Zhu Du,et al.  Connectivity of Consecutive-d Digraphs , 1992, Discret. Appl. Math..

[12]  D. Frank Hsu,et al.  Distributed Loop Computer Networks: A Survey , 1995, J. Parallel Distributed Comput..

[13]  Ding-Zhu Du,et al.  The Hamiltonian property of generalized de Bruijn digraphs , 1991, J. Comb. Theory, Ser. B.

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

[15]  Frank K. Hwang,et al.  The Hamiltonian property of linear functions , 1987 .

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

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