Lower connectivities of regular graphs with small diameter

DOI10.1016/J.DISC.2005.11.062MaRDI QIDQ878612zbMATH OpenOpenAlexFDO

Authors C. Balbuena, Xavier Marcote

Publication date 26 April 2007

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.11.062

zbMATH Keywords

bipartiteconnectivitycutsetdiametergirth

Mathematics Subject Classification ID

Connectivity (05C40)

Review text

A graph is called \(d\)-regular if all its vertices have the same degree \(d\). Lower bounds of the connectivities of a \(d\)-regular graph are established with given bounds on the diameter \(D\) in terms of the girth \(g\) of the graph. The authors show that a graph is 2-connected whenever \(D\leq g\), and it is 4-connected if \(D\leq g-1\). Some examples for particular values of the girth and the regularity are presented to show that the results are best possible.

Recommendations

• Connectivity of Regular Directed Graphs with Small Diameters
• Superconnectivity of regular graphs with small diameter
• Lower-bounds on the connectivities of a graph
• Smallest regular graphs of given degree and diameter
• On the connectivity and superconnected graphs with small diameter
• Diameter and connectivity of finite simple graphs
• Minimum order graphs with specified diameter, connectivity, and regularity
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• The minimum order of n-connected n-regular graphs with specified diameters
• Connected graphs of diameter two having small degree distances

Cites work

• Bipartite graphs and digraphs with maximum connectivity
• Connectivity of Regular Directed Graphs with Small Diameters
• scientific article; zbMATH DE number 4162905 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 927075 (Why is no real title available?)
• Lower-bounds on the connectivities of a graph
• Maximally connected digraphs
• Minimum order graphs with specified diameter, connectivity, and regularity
• On the order and size of s-geodetic digraphs with given connectivity
• Sufficient conditions for maximally connected dense graphs

Cited in

(11)

• Degrees in link graphs of regular graphs
• On superconnectivity of (4,g)-cages with even girth
• The minimum order of n-connected n-regular graphs with specified diameters
• scientific article; zbMATH DE number 4081595 (Why is no real title available?)
• Lower-bounds on the connectivities of a graph
• On the number of connected subgraphs with small edge‐boundary in regular graphs
• scientific article; zbMATH DE number 867634 (Why is no real title available?)
• Mader's conjecture for graphs with small connectivity
• Attainable bounds for algebraic connectivity and maximally connected regular graphs
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On the connectivity and superconnected graphs with small diameter

This page was built for publication: Lower connectivities of regular graphs with small diameter

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