On connectivity of consecutive-d digraphs

Discrete Mathematics

Volumn 257, Issue 2-3, 2002, Pages 371-384

  Du, Ding Zhu ^a   Hsu, D F ^b   Ngo, Hung Q ^c   Peck, G W ^d,e  

^a University of Minnesota   (United States)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

^c FORDHAM UNIVERSITY   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e the State University of New York   (United States)

Author keywords

Connectivity; Consecutive d digraphs; Interconnection networks

Indexed keywords

EID: 31244434315     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00436-3     Document Type: Article

References (24)

1. J.C. Bermond, F. Comellas, D.F. Hsu, Distributed loop computer networks: a survey, Journal of Parallel and Distributed Computing 24 (1995) 2-10.
2. J.C. Bermond, N. Homobono, C. Peyrat, Connectivity of Kautz networks, in: Proceedings of the French-Israel Conference on Combinatorics, Jerusalem, 1988.
3. J.C. Bermond, N. Homobono, C. Peyrat, Large fault-tolerant interconnection networks, Graphs Combin. 5 (1989) 107-123.
4. J.C. Bermond, C. Peyrat, Broadcasting in de Bruijn networks, in: Proceedings of the 19th Southeastern Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, 1988, Congressus Numerantium 66 (1988) 283-292.
5. J.C. Bermond, C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube?, in: Proceedings of the First European Workshop on Hypercube and Distributed Computers, Rennes, Elsevier, North-Holland, 1989, pp. 279-293.
6. J. Bond, A. Ivanyi, Modeling of interconnection networks using de bruijn graphs, in: A. Vitanyi (Ed.), Proceedings of the Third Conference of Program Designers, Budapest, 1987, pp. 75-88.
7. N.G. de Bruijn, A Combinatorial Problem, in: Koninklijke Nederlandse Academic van Wetenschappen Proc., Vol. A49, 1946, pp. 758-764.
8. F.K. Chung, Diameter of communication networks, Proc. Symp. Appl. Math. 34 (1986) 1-18.
9. D.Z. Du, D.F. Hsu, On Hamiltonian consecutive-d digraphs, Combin. Graph Theory 25 (1989) 47-55.
10. D.Z. Du, D.F. Hsu, F.K. Hwang, Doubly-linked ring networks, IEEE Trans. Comput. C-34 (1985) 853-855.
11. D.Z. Du, D.F. Hsu, F.K. Hwang, Hamiltonian property of d-consecutive digraphs, Math. Comput. Modeling 17 (11) (1993) 61-63.
12. D.Z. Du, D.F. Hsu, F.K. Hwang, X.M. Zhang, The Hamiltonian property of generalized de bruijn digraphs, J. Combin. Theory Ser. B 52 (1991) 1-8.
13. D.Z. Du, D.F. Hsu, D.J. Kleitman, Modification of consecutive-d digraphs, in: Interconnection Networks and Mapping and Scheduling Parallel Computation, Amer. Math. Soc., Providence, RI, 1995, pp. 75-85.
14. D.Z. Du, D.F. Hsu, G.W. Peck, Connectivity of consecutive-d digraphs, Discrete Appl. Math. 38 (1992) 169-178.
15. M.A. Fiol, J.L.A. Yebra, I.A. de Miquel, Line digraph iterations and the (d,k) digraph problem, IEEE Trans. Comput. C-33 (5) (1984) 400-403.
16. N. Homobono, Connectivity of generalized de Bruijn and Kautz graphs, in: Proceedings of the 11th British Conference, London, 1987 Ars Combinatoria 25 (1988) 179-194.
17. N. Homobono, C. Peyrat, Connectivity of Imase and Itoh digraphs, IEEE Trans. Comput. C-37 (11) (1988) 1459-1461.
18. F.K. Hwang, The Hamiltonian property of linear functions, Oper. Res. Lett. 6 (1987) 125-127.
19. M. Imase, M. Itoh, Design to minimize a diameter on building block network, IEEE Trans. Comput. C-30 (6) (1981) 439-442.
20. M. Imase, M. Itoh, A design for directed graphs with minimum diameter, IEEE Trans. Comput. C-32 (8) (1983) 782-784.
21. M. Imase, T. Soneoka, K. Okada, Connectivity of Regular Directed Graphs with Small Diameters, IEEE Trans. Comput. c-34 (3) (1985) 267-273.
22. W.H. Kautz, Bounds on Directed (d,k) Graphs, Theory of Cellular Logic Networks and Machines, AFCRL-68-0668, Final Report, 1968, pp. 20-28.
23. S.M. Reddy, J.G. Kuhl, S.H. Hosseini, H. Lee, On digraphs with minimum diameter and maximum connectivity, in: Proceedings of the 20th Annual Allerton Conference, 1982, pp. 1018-1026.
24. S.M. Reddy, D.K. Pradhan, J.G. Kuhl, Directed graphs with minimal diameter and maximal connectivity, Technical Report, School of Engineering, Oakland University, Technical Report, 1980.