Complete catalogue of graphs of maximum degree 3 and defect at most 4

DOI10.1016/j.dam.2009.04.021zbMath1211.05036OpenAlexW2081884894MaRDI QIDQ967350

Mirka Miller, Guillermo Pineda-Villavicencio

Publication date: 28 April 2010

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

Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/44848

zbMATH Keywords

cubic graphsdefectMoore bounddiameter problemMoore graphsdegree problem

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (3)

TOPOLOGY OF INTERCONNECTION NETWORKS WITH GIVEN DEGREE AND DIAMETER ⋮ On graphs of defect at most 2 ⋮ The Degree-Diameter Problem for Claw-Free Graphs and Hypergraphs

Cites Work

• Nonexistence of certain cubic graphs with small diameters
• Large graphs with given degree and diameter. II
• 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
• A new 5‐arc‐transitive cubic graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complete catalogue of graphs of maximum degree 3 and defect at most 4