Smallest regular graphs of given degree and diameter

DOI10.7151/dmgt.1702zbMath1285.05101OpenAlexW2053648618MaRDI QIDQ5405283

Martin Knor

Publication date: 2 April 2014

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1702

zbMATH Keywords

regular graphextremal graphdegree/diameter problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex degrees (05C07)

Related Items (1)

Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Regular graphs with excess one
• Moore graphs and beyond: a survey of the degree/diameter problem
• Smallest Vertex-Transitive Graphs of Given Degree and Diameter
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2

This page was built for publication: Smallest regular graphs of given degree and diameter