Superfluous edges and exponential expansions of de Bruijn and Kautz graphs

DOI10.1016/S0166-218X(03)00463-3zbMath1042.05048OpenAlexW2001925455MaRDI QIDQ1827806

Eduardo A. Canale, José Gómez

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00463-3

zbMATH Keywords

de Bruijn graphsKautz graphs(\(\Delta,D\))-problemEdge-critical graphsLarge graphsSuperfluous edges

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Asymptotically approaching the Moore bound for diameter three by Cayley graphs ⋮ Distant irregularity strength of graphs

Cites Work

• Extensions de réseaux de connexité donnée. (Extensions of graphs of given connectivity)
• Extensions of networks with given diameter
• Graphs on alphabets as models for large interconnection networks
• Grands Graphes De Degré Et Diamètre Fixés
• A Design for Directed Graphs with Minimum Diameter
• The partial line digraph technique in the design of large interconnection networks
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Superfluous edges and exponential expansions of de Bruijn and Kautz graphs