Asymptotically large (,D)-graphs

DOI10.1016/J.DAM.2005.03.008MaRDI QIDQ2576342zbMATH OpenOpenAlexFDO

Authors Eduardo A. Canale, J. Gomez

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

de Bruijn digraphdegree-diameter problemKautz digraphexchange graphgraph-digraph product

Mathematics Subject Classification ID

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

Recommendations

• Large graphs with given degree and diameter. II
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• On large ( ,D)-graphs
• Some large graphs with given degree and diameter
• Large Graphs with Given Degree and Diameter—Part I

Cites work

• scientific article; zbMATH DE number 4089545 (Why is no real title available?)
• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 6004 (Why is no real title available?)
• A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
• Graphs on alphabets as models for large interconnection networks
• Large graphs with given degree and diameter. II
• Line Digraph Iterations and the (d, k) Digraph Problem
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs
• The diameter of random regular graphs

Cited in

(16)

• Sufficient conditions for maximally connected dense graphs
• \(t\)-strong cliques and the degree-diameter problem
• A lower bound for the spectral radius of graphs with fixed diameter
• Asymptotically optimal \((\Delta, D', s)\)-digraphs
• scientific article; zbMATH DE number 7378741 (Why is no real title available?)
• scientific article; zbMATH DE number 3212732 (Why is no real title available?)
• \(t\)-strong cliques and the degree-diameter problem
• Approximate Moore graphs are good expanders
• Large k‐preserving sets in infinite graphs
• Trade-offs among degree, diameter, and number of paths
• The asymptotics of large constrained graphs
• Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
• The degree-diameter problem for claw-free graphs and hypergraphs
• The degree-diameter problem for sparse graph classes
• Maximizing line subgraphs of diameter at most \(t\)
• Large Graphs with Given Degree and Diameter—Part I

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576342)