Superfluous edges and exponential expansions of De Bruijn and Kautz graphs
A new way to expand De Bruijn and Kautz graphs is presented. It consists of deleting superfluous 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 gr...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Format: | article |
| Langue: | anglais |
| Publié: |
2004
|
| Sujets: | |
| Accès en ligne: | https://hdl.handle.net/20.500.12008/51365 |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires: Superfluous edges and exponential expansions of De Bruijn and Kautz graphs
- Asymptotically large (Δ,D)-graphs.
- On the application of graph neural networks for indoor positioning systems.
- Network reliability analysis and intractability of counting diameter crystal graphs
- Uniformly Optimally Reliable Graphs: A Survey
- Image forgery detection via forensic similarity graphs
- Global Synchronization Properties for Different Classes of Underlying Interconnection Graphs for Kuramoto Coupled Oscillators