The smallest graphs with certain adjacency properties

DOI10.1016/0012-365X(90)90283-NzbMATH Open0446.05026OpenAlexW1991689454WikidataQ127156126 ScholiaQ127156126MaRDI QIDQ1145705FDOQ1145705

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

• Title not available (Why is that?)
• Parallel concepts in graph theory
• On Moore Graphs with Diameters 2 and 3
• A smallest graph of girth 5 and valency 5
• The smallest graph of girth 5 and valency 4
• A smallest graph of girth 5 and valency 6

Cited In (3)

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

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)