Regular separable graphs of minimum order with given diameter

DOI10.1016/0012-365X(81)90273-9zbMath0453.05039MaRDI QIDQ1148920

B. R. Myers

Publication date: 1981

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

zbMATH Keywords

diameterregular separable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (2)

Classification and enumeration of minimum (d, 3, 3)-graphs for odd d ⋮ Minimum graphs of specified diameter, connectivity and valence. II

Cites Work

• On graphs with diameter 2
• Extremal graphs of diameter 4
• Classification and enumeration of minimum (d, 3, 3)-graphs for odd d
• Classification and enumeration of minimum (d,1,3)-graphs and minimum (d,2,3)-graphs
• Parallel concepts in graph theory
• Minimum graphs of specified diameter, connectivity and valence. II
• On the diameter of a graph
• On Moore Graphs with Diameters 2 and 3
• Longest Simple Paths in Polyhedral Graphs
• The Klee and Quaife minimum (d, 1, 3)-graphs revisited
• The minimum-order three-connected cubic graphs with specified diameters
• An Extremal Problem of Graphs with Diameter 2
• A Design for (d, k) Graphs
• A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table
• A problem of the theory of communication networks
• On some extremal graphs
• On the Equivalence of Finite-State Sequential Machine Models
• On Critical Graphs of Diameter 2
• On (d, k, μ) Graphs
• Improved Construction Techniques for (d, k) Graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Diameters of Polyhedral Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular separable graphs of minimum order with given diameter