On the number of components of \((k,g)\)-cages after vertex deletion

DOI10.1016/j.dam.2008.12.005zbMath1173.05336OpenAlexW2080585220MaRDI QIDQ1026135

Mirka Miller, Camino Balbuena, Yu-qing Lin

Publication date: 24 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.12.005

zbMATH Keywords

connectivitycagesdisconnecting set

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sufficient conditions for maximally connected dense graphs
• \((k,g)\)-cages are 3-connected
• On the order and size of \(s\)-geodetic digraphs with given connectivity
• Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
• (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
• Maximally connected digraphs
• Connectivity of cages
• Edge-superconnectivity of cages
• The Smallest Cubic Graphs of Girth Nine
• All (k;g)‐cages are edge‐superconnected

This page was built for publication: On the number of components of \((k,g)\)-cages after vertex deletion