Connectivity of Consecutive-d Digraphs

Abstract The concept of consecutive- d digraph is proposed by Du, Hsu and Hwang. It generalizes the class of de Bruijin digraphs, the class of Imase-Itoh digraphs and the class of generalized de Bruijin graphs. We modify consecutive- d digraphs by connecting nodes with a loop into a circuit and deleting all loops. The result in this paper shows that the link-connectivity or the connectivity of modified consecutive- d digraphs get better.

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

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

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

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

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

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

[7]  Hiroshi Nakada,et al.  Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter , 1990, Discret. Appl. Math..

[8]  Yahya Ould Hamidoune,et al.  Quelques problèmes de connexité dans les graphes orientés , 1981, J. Comb. Theory, Ser. B.

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

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