The minimum order of n-connected n-regular graphs with specified diameters

DOI10.1109/TCS.1985.1085709zbMath0579.05032OpenAlexW2078489577MaRDI QIDQ3701449

Debashis Bhattacharya

Publication date: 1985

Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcs.1985.1085709

zbMATH Keywords

diameterconnectivityregular graphminimum graph

Mathematics Subject Classification ID

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

Related Items (4)

Distances in graphs of girth 6 and generalised cages ⋮ The maximum radius of graphs with given order and minimum degree ⋮ Minimum orders of Eulerian oriented digraphs with given diameter ⋮ APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION

This page was built for publication: The minimum order of n-connected n-regular graphs with specified diameters