Super line-connectivity of consecutive-d digraphs

Discrete Mathematics

Volumn 183, Issue 1-3, 1998, Pages 27-38

  Cao, Feng ^a   Du, Ding Zhu ^a,b   Hsu, D Frank ^c   Hwang, Lihui ^a   Wu, Weili ^a  

^a University of Minnesota   (United States)

^b INSTITUTE OF APPLIED MATHEMATICS   (China)

^c FORDHAM UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037801359     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00079-4     Document Type: Article

References (33)

1. J.C. Bermond, N. Homobono, C. Peyrat, Large fault-tolerant interconnection networks, Graphs Combin. (1989).
2. J.C. Bermond, C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube?, in: F. Andre, J.P. Verjus (Eds.), Hypercube and Distributed Computers, North-Holland, Amsterdam, 1989 pp. 279-294.
3. J.C. Bermond, C. Peyrat, Broadcasing in de Bruijn networks, Proc. 19th Southeastern Conf. on Combinatorics, Graph Theory and Computing, 1988.
4. J.C. Bermond, N. Homobono, C. Peyrat, Connectivity of Kautz networks, French-Israel Conf. on Combinatorics, Jerusalem, 1988.
5. J. Bond, A. Ivanyi, Modeling of interconnection networks using de Bruijn graphs, in: A. Vitanyi (Ed.), Proc. 3rd Conf. of Program Designers, Budapest, 1987, pp. 75-88.
6. N.G. de Bruijn, A combinatorial problem, Koninklijke Nederlandse Academie van Wetenschappen Proc. A 49 (1946) 758-764.
7. F.K. Chung, Diameter of communication networks, Proc. Symp. in Applied Mathematics 34 (1986) 1-18.
8. D.-Z. Du, D.F. Hsu, F.K. Hwang, Doubly-linked ring networks, IEEE Trans. Comput. C-34 (1985) 853-855.
9. D.-Z. Du, D.F. Hsu, On hamiltonian consecutive-d digraphs, in: Combinatorics and Graph Theory, Banach Center Publication, vol. 25, Warsaw, 1989, pp. 47-55.
10. D.-Z. Du, D.F. Hsu, F.K. Hwang, Hamiltonian property of d-consecutive digraphs, Math. Comput. Modeling 17 (11) (1993) 61-63.
11. 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.
12. D.-Z. Du, D.F. Hsu, D.J. Kleitman, Modifications of consecutive-d digraphs, in: D.F. Hsu, A.L. Rosenberg, D. Soteau (Eds.), Interconnection Networks and Mapping and Scheduling Parallel Computations, American Mathematical Society, Providence, RI, 1994, pp. 75-85.
13. D.-Z. Du, D.F. Hsu, D.J. Kleitman, On connectivity of consecutive-d digraphs, manuscript.
14. D.-Z. Du, D.F. Hsu, G.W. Peck, Connectivity of consecutive-d digraphs, Discrete Appl. Math. 37/38 (1992) 169-177.
15. D.-Z. Du, F.K. Hwang, Generalized de Bruijn digraphs, Networks 18 (1988) 27-33.
16. M.A. Fiol, J.L.A. Yebra, I. Alegre, Line digraph iterations and the (d,k) digraph problem, IEEE Trans. Comput. C-33 (1984) 702-713.
17. Y.O. Hamidoune, A.S. Llado, O. Serra, Vosperian and superconnected abelian Cayley digraphs, Graphs Combin. 7 (1991) 143-152.
18. N. Homobono, Connectivity of generalized de Bruijn and Kautz graphs, Proc. 11th British Conf., Ars Combin., 1988.
19. N. Homobono, C. Peyrat, Connectivity of Imase and Itoh digraphs, IEEE Trans. Comput., 1988.
20. D.F. Hsu, On container width and length in graphs, groups, and networks, IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences E77-A:4 (1994) 668-680.
21. F.K. Hwang, The hamiltonian property of linear functions, Oper. Res. Lett. 6 (1987) 125-127.
22. M. Imase, M. Itoh, Design to minimize a diameter on Building block network, IEEE Trans. Comput. C-30 (1981) 439-443.
23. M. Imase, M. Itoh, A design for directed graph with minimum diameter, IEEE Trans. Comput. C-32 (1983) 782-784.
24. M. Imase, T. Soneoka, K. Okada, Connectivity of regular directed graphs with small diameter, IEEE Trans. Comput. C-34 (1985) 267-273.
25. M. Imase, I. Soneoka, K. Okada, A fault tolerant processor interconnection network, Systems and Computers in Japan 17 (8) (1986) 21-30.
26. 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.
27. V.P. Kumar, S.M. Reddy, A class of graphs for fault-tolerant processor interconnections, IEEE 1984 Int. Conf. Distributed Computing Systems, 1984, pp. 448-460.
28. M. Mora, O. Serra, M.A. Fiol, General properties of c-circulant digraphs, Ars Combin. 25C (1988) 241-252.
29. S.M. Reddy, J.G. Kuhl, S.H. Hosseini, H. Lee, On digraphs with minimum diameter and maximum connectivity, Proc. 20th Annual Allerton Conf., 1982, pp. 1018-1026.
30. S.M. Reddy, D.K. Pradhan, J.G. Kuhl, Directed graphs with minimal diameter and maximal connectivity, School of Engineering Oakland Univ. Tech. Rep., 1980.
31. T. Soneoka, H. Nakada, M. Imase, Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter I, Discrete Appl, Math. 27 (1990) 255-265.
32. T. Soneoka, M. Imase, Y. Manabe, Design of d-connected digraph with a minimum number of edges and a quasiminimal diameter II, Discrete Appl. Math. 64 (1996) 267-279.
33. T. Soneoka, Super edge-connectivity of dense digraphs and graphs, manuscript.