Asymptotically large (\(\Delta,D\))-graphs

DOI10.1016/j.dam.2005.03.008zbMath1080.05027OpenAlexW1974840557MaRDI QIDQ2576342

Eduardo A. Canale, José Gómez

Publication date: 27 December 2005

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.008

zbMATH Keywords

Kautz digraphde Bruijn digraphdegree-diameter problemexchange graphgraph-digraph product

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (9)

Maximizing Line Subgraphs of Diameter at Most t ⋮ Unnamed Item ⋮ Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups ⋮ The degree-diameter problem for sparse graph classes ⋮ A lower bound for the spectral radius of graphs with fixed diameter ⋮ Approximate Moore graphs are good expanders ⋮ $t$-Strong Cliques and the Degree-Diameter Problem ⋮ The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs ⋮ Trade-offs among degree, diameter, and number of paths

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large graphs with given degree and diameter. II
• Graphs on alphabets as models for large interconnection networks
• A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
• The diameter of random regular graphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs

This page was built for publication: Asymptotically large (\(\Delta,D\))-graphs