The smallest graphs with certain adjacency properties

DOI10.1016/0012-365X(90)90283-NzbMath0446.05026OpenAlexW1991689454WikidataQ127156126 ScholiaQ127156126MaRDI QIDQ1145705

Frank Harary, Geoffrey Exoo

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0012-365x(90)90283-n

zbMATH Keywords

smallest graph with property

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (3)

Binary Covering Arrays and Existentially Closed Graphs ⋮ Graph theoretic models ⋮ The ubiquitous Petersen graph

Cites Work

• Unnamed Item
• A smallest graph of girth 5 and valency 6
• Parallel concepts in graph theory
• 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

This page was built for publication: The smallest graphs with certain adjacency properties