On graphs of defect at most 2

DOI10.1016/j.dam.2011.04.018zbMath1225.05087arXiv1010.5658OpenAlexW2012361767MaRDI QIDQ2275941

Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio

Publication date: 10 August 2011

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

Full work available at URL: https://arxiv.org/abs/1010.5658

zbMATH Keywords

defectMoore boundMoore graphdiameter problemrepeatdegree problem

Mathematics Subject Classification ID

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

Related Items

On graphs with excess or defect 2 ⋮ The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs ⋮ Smallest Vertex-Transitive Graphs of Given Degree and Diameter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural properties of graphs of diameter 2 and defect 2
• On graphs with cyclic defect or excess
• On bipartite graphs of defect at most 4
• Graphs of order two less than the Moore bound
• Complete catalogue of graphs of maximum degree 3 and defect at most 4
• On the existence of graphs of diameter two and defect two
• Cycles in strong oriented graphs
• Regular graphs with excess one
• Diameters of cubic graphs
• Maximal cubic graphs with diameter 4
• Moore graphs and beyond: a survey of the degree/diameter problem
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• Largest Graphs of Diameter 2 and Maximum Degree 6