Graphs of order two less than the Moore bound

DOI10.1016/j.disc.2006.06.045zbMath1146.05021OpenAlexW2003971080MaRDI QIDQ924968

Mirka Miller, Rinovia Simanjuntak

Publication date: 29 May 2008

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.06.045

zbMATH Keywords

Moore bounddegree/diameter problemrepeat

Mathematics Subject Classification ID

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

Related Items (2)

Graphs of order two less than the Moore bound ⋮ On graphs of defect at most 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large graphs with given degree and diameter. II
• Graphs of order two less than the Moore bound
• Regular graphs with excess one
• Diameters of cubic graphs
• On Moore Graphs with Diameters 2 and 3
• Large Graphs with Given Degree and Diameter—Part I
• Minimum Diameter of Diregular Digraphs of Degree 2
• Maximum degree in graphs of diameter 2
• New results for the degree/diameter problem

This page was built for publication: Graphs of order two less than the Moore bound