A smallest graph of girth 5 and valency 6

DOI10.1016/0095-8956(79)90052-2zbMath0427.05043OpenAlexW2038615475MaRDI QIDQ1136778

S. H. Smith

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90052-2

zbMATH Keywords

girthregular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (10)

New small regular graphs of girth 5 ⋮ Some new upper bounds of \(\operatorname{ex}(n;\{C_3,C_4\})\) ⋮ The smallest graphs with certain adjacency properties ⋮ A smallest graph of girth 10 and valency 3 ⋮ New family of small regular graphs of girth 5 ⋮ Regular graphs of girth 5 from elliptic semiplanes of type \(C\) ⋮ Girth 5 graphs from relative difference sets ⋮ On the uniqueness of the smallest graph of girth 5 and valency 6 ⋮ Elliptic semiplanes and regular graphs with girth 5 ⋮ Improving bounds on the order of regular graphs of girth 5

Cites Work

• A smallest graph of girth 5 and valency 5
• On Moore Graphs with Diameters 2 and 3
• The smallest graph of girth 5 and valency 4
• Unnamed Item

This page was built for publication: A smallest graph of girth 5 and valency 6