Lower connectivities of regular graphs with small diameter

DOI10.1016/j.disc.2005.11.062zbMath1118.05051OpenAlexW1963961136MaRDI QIDQ878612

Camino 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

bipartitediametercutsetconnectivitygirth

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items

Maximally edge-connected and vertex-connected graphs and digraphs: A survey, On the connectivity and superconnected graphs with small diameter, On superconnectivity of (4,g)-cages with even girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• On the order and size of \(s\)-geodetic digraphs with given connectivity
• Bipartite graphs and digraphs with maximum connectivity
• Connectivity of Regular Directed Graphs with Small Diameters
• Lower-bounds on the connectivities of a graph
• Minimum order graphs with specified diameter, connectivity, and regularity
• Maximally connected digraphs