2-Diameter of de Bruijn graphs

Networks

Volumn 28, Issue 1, 1996, Pages 7-14

  Li, Qiao ^a   Sotteau, Dominique ^b   Xu, Junming ^c  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^c UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039056135     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199608)28:1<7::AID-NET2>3.0.CO;2-J     Document Type: Article

References (7)

1. J. Bermond and C. Peyrat, de Bruijn and Kautz networks: a competitor for the hypercube? Proceedings of the 1st European Workshop on Hypercube and Distributed Computers, North-Holland, Amsterdam (1989) 279-294.
2. D. K. Pradhan, Fault tolerant VLSI architectures based on de Bruijn graphs (Galileo in the mid nineties). Reliability of Computer and Communication Networks, DI-MACS Series in Discr. Math. Theor. Comput. Sci. 5 (1991) 183-196.
3. A. Esfahanian and L. Hakimi, Fault tolerant routing in de bruijn networks. IEEE Trans. Comput. 34(9) (1985) 777-788.
4. F. Hsu, On container width and length in graphs, groups, and networks. IEICE Trans. Fundam. E(77A) (1994) 668-680.
5. F. Hsu and T. Luczak, Note on the k-diameter of k-regular k-connected graphs. Discr. Math., 132 (1994) 291-296.
6. F. Hsu and Y. Lyun, A graph theoretical study of transmission delay and fault tolerance. Proceedings of the 4th ISSM International Conference on Parallel and Distributed Computing and Systems (1991) 20-24.
7. D. Pradhan and S. Reddy, A fault tolerant communication architecture for distributed systems. IEEE Trans. Comput. 31 (9) (1982) 863-870.