Superfluous edges and exponential expansions of De Bruijn and Kautz graphs

Authors:
Eduardo A. Canale;José Gómez
Affiliations:
Dipartimento Matemàtica Aplicada IV i Telemàtica, Universitat Politècnica de Catalunya, c/Jordi Girona 1-3, Mod C3-Campus Nord, 08034 Barcelona, Spain;Dipartimento Matemàtica Aplicada IV i Telemàtica, Universitat Politècnica de Catalunya, c/Jordi Girona 1-3, Mod C3-Campus Nord, 08034 Barcelona, Spain
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 4
Cited 0

Graphs & digraphs (2nd ed.)

Graphs & digraphs (2nd ed.)
Extensions of networks with given diameter

Discrete Mathematics
Graphs on alphabets as models for large interconnection networks

Discrete Applied Mathematics - Special double volume: interconnection networks
The Partial Line Digraph Technique in the Design of Large Interconnection Networks

IEEE Transactions on Computers

Quantified Score

Hi-index	0.04

Visualization

Abstract

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 graph, for a fixed maximum degree greater than four, is exponential on the diameter. Tables with lower bounds for the order of superfluous sets of edges and the number of vertices that can be added, are presented.