De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has an influence on both communication properties of the network and the algorithmi
Extension of de Bruijn graph and Kautz graph
β Scribed by Y. Shibata; Y. Gonda
- Book ID
- 108022534
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 560 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0898-1221
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We give here a complete description of the spectrum of de Bruijn and Kautz graphs. It is well known that spectral techniques have proved to be very useful tools to study graphs, and we give some examples of application of our result, by deriving tight bounds on the expansion parameters of those grap
A new way to expand De Bruijn and Kautz graphs is presented. It consists of deleting super uous sets of edges (i.e., those whose removal does not increase the diameter) and adding new vertices and new edges preserving the maximum degree and the diameter. The number of vertices added to the Kautz gra