Superconnectivity of regular graphs with small diameter

DOI10.1016/J.DAM.2008.11.002zbMath1184.05074OpenAlexW2039942010MaRDI QIDQ1028102

Jianmin Tang, Kim Marshall, Camino Balbuena, Yu-qing Lin

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.002

zbMATH Keywords

diametercutsetconnectivitygirthsuperconnectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40)

Related Items (3)

Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Super-connected but not super edge-connected graphs ⋮ On the connectivity and superconnected graphs with small diameter

Cites Work

• On the restricted connectivity and superconnectivity in graphs with given girth
• Sufficient conditions for maximally connected dense graphs
• Circulants and their connectivities
• Synthesis of reliable networks - a survey
• Maximally connected digraphs
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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