Minimum graphs of specified diameter, connectivity and valence. II

DOI10.1016/0012-365X(89)90182-9zbMath0760.05057OpenAlexW2053196533MaRDI QIDQ1812779

Yanyan Li

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90182-9

zbMATH Keywords

diameterconnectivityvalence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (7)

Regular separable graphs of minimum order with given diameter ⋮ The maximum radius of graphs with given order and minimum degree ⋮ Minimum orders of Eulerian oriented digraphs with given diameter ⋮ Decomposition of 3-connected cubic graphs ⋮ 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 ⋮ APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION

Cites Work

• Regular separable graphs of minimum order with given diameter
• 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
• Ordre Minimum D'un Graphe Simple De Diametre, Degre Minimum Et Connexite Donnes
• The Klee and Quaife minimum (d, 1, 3)-graphs revisited
• Unnamed Item

This page was built for publication: Minimum graphs of specified diameter, connectivity and valence. II