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

DOI10.1109/TCS.1985.1085709MaRDI QIDQ3701449zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Minimum order graphs with specified diameter, connectivity, and regularity
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter
• Lower connectivities of regular graphs with small diameter
• Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter. II
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs

Cited in

(9)

• scientific article; zbMATH DE number 3987314 (Why is no real title available?)
• Minimum order graphs with specified diameter, connectivity, and regularity
• Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
• Finding a -regular supergraph of minimum order
• Lower connectivities of regular graphs with small diameter
• Minimum orders of Eulerian oriented digraphs with given diameter
• Distances in graphs of girth 6 and generalised cages
• APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION
• The maximum radius of graphs with given order and minimum degree

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

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