The smallest graphs with certain adjacency properties

DOI10.1016/0012-365X(90)90283-NMaRDI QIDQ1145705zbMATH OpenOpenAlexWikidataFDO

Authors Geoffrey Exoo, Frank Harary

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)

Cites work

• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• A smallest graph of girth 5 and valency 5
• A smallest graph of girth 5 and valency 6
• On Moore Graphs with Diameters 2 and 3
• Parallel concepts in graph theory
• The smallest graph of girth 5 and valency 4

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145705)