A smallest graph of girth 5 and valency 5

DOI10.1016/0095-8956(73)90003-8zbMath0261.05128OpenAlexW2090328327MaRDI QIDQ2560430

G. Wegner

Publication date: 1973

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(73)90003-8

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (15)

New small regular graphs of girth 5 ⋮ A smallest graph of girth 5 and valency 6 ⋮ The smallest graphs with certain adjacency properties ⋮ A smallest graph of girth 10 and valency 3 ⋮ The non-existence of certain regular graphs of girth 5 ⋮ On graphs with excess or defect 2 ⋮ New family of small regular graphs of girth 5 ⋮ Un problème extremal pour les graphes et les hypergraphes ⋮ 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 ⋮ A note on a paper of G. Wegner ⋮ Elliptic semiplanes and regular graphs with girth 5 ⋮ Net structure and cages ⋮ Improving bounds on the order of regular graphs of girth 5

Cites Work

• Unnamed Item
• On Moore Graphs with Diameters 2 and 3
• On the Non-Existence of a Type of Regular Graphs of Girth 5
• The smallest graph of girth 5 and valency 4

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