The spectrum of de Bruijn and Kautz graphs

European Journal of Combinatorics

Volumn 19, Issue 3, 1998, Pages 307-319

  Delorme, Charles ^a   Tillich, Jean Pierre ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041494566     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1997.0183     Document Type: Article

References (15)

1. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986), 83-96.
2. J. C. Bermond, N. Homobono, and C. Peyrat, Large fault-tolerant interconnexion networks, Graphs and Combinatorics 5 (1989), 107-123.
3. J. C. Bermond and C. Peyrat, The de Bruijn and Kautz networks: a competitor for the hypercube?, in Hypercube and Distributed Computers, Proc. 1st Europ. Workshop on Hypercube and Distributed Computers, Rennes 1989, pp. 279-293. Elsevier, North-Holland, 1989.
4. F. R. K. Chung, Constructing random-like graphs, in B. Bollobas (Ed.), Proc. Symp. Applied Mathematics, Probabilistic Combinatorics and its Applications, vol. 44, AMS, Rhode Island (1991), pp. 21-56.
5. O. Collins, S. Dolinar, R. McEliece, and F. Pollara, A V.L.S.I. decomposition of the de Bruijn graphs, J. ACM 39 (1992), pp. 931-949.
6. D. M. Cvetković, M. Doob, and H. Sachs, Spectra of Graphs, Academic Press, New York, 1980.
7. A. H. Esfahanian and S. L. Hakimi, Fault-tolerant routing in de Bruijn communications networks, IEEE Trans. Comput. C-34 (1985), 777-788.
8. H. Fredricksen, A survey of full length nonlinear shift register cycle algorithms, SIAM Rev. 24 (1982), 195-221.
9. M. C. Heydemann, J. C. Meyer, and D. Sotteau, On forwarding indices of networks, Discrete Appl. Math. 23 (1989), 103-123.
10. F. T. Leighton, Parallel Algorithms and Architectures: Arrays-Trees-Hypercubes, Morgan Kaufmann, San Mateo, CA, 1992.
11. A. Lempel, On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers, IEEE Trans. Comput. C-12 (1970), 1204-1209.
12. B. Mohar, Isoperimetric number of graphs, J. Combin. Theory, Ser. B 47 (1989), 274-291.
13. D. K. Pradhan, Fault tolerant multiprocessor link and bus network architectures, IEEE Trans. Comput. C-34 (1985), 33-45.
14. P. Sole, Expanding and forwarding, Discrete Appl. Math. 58 (1995), 67-78.
15. A. J. Sinclair and M. R. Jerrum, Approximate counting, uniform generation, and rapidly mixing Markov chains, Information and Computation 89 (1989), 93-133.