Smallest regular graphs of given degree and diameter

DOI10.7151/DMGT.1702MaRDI QIDQ5405283zbMATH OpenOpenAlexFDO

Authors Martin Knor

Publication date 2 April 2014

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

degree/diameter problemextremal graphregular graph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3432305 (Why is no real title available?)
• scientific article; zbMATH DE number 3412694 (Why is no real title available?)
• Maximum degree in graphs of diameter 2
• Moore graphs and beyond: a survey of the degree/diameter problem
• On Moore Graphs with Diameters 2 and 3
• Regular graphs with excess one
• Smallest vertex-transitive graphs of given degree and diameter

Cited in

(8)

• Minimum order graphs with specified diameter, connectivity, and regularity
• Small graphs and hypergraphs of given degree and girth
• On smallest regular graphs with a given isopart
• Lower connectivities of regular graphs with small diameter
• scientific article; zbMATH DE number 2121222 (Why is no real title available?)
• Graphs with small diameter determined by their $D$-spectra
• A smallest irregular oriented graph containing a given diregular one
• Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs

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

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