Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages

DOI10.1016/j.disc.2004.07.024zbMath1080.05053OpenAlexW2169093251MaRDI QIDQ2568484

Mirka Miller, Yu-qing Lin, Camino Balbuena

Publication date: 10 October 2005

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

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

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (11)

On superconnectivity of (\(4, g\))-cages ⋮ Monotonicity of the order of \((D;g)\)-cages ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Diameter and connectivity of (D; g)-cages ⋮ New improvements on connectivity of cages ⋮ Unnamed Item ⋮ A new bound for the connectivity of cages ⋮ On the connectivity of semiregular cages ⋮ On superconnectivity of (4,g)-cages with even girth ⋮ On the number of components of \((k,g)\)-cages after vertex deletion ⋮ Edge-superconnectivity of semiregular cages with odd girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connectivity of cages with girth five, six and eight
• 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
• Every cubic cage is quasi 4-connected
• A note on the edge-connectivity of cages
• (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
• Cages—a survey
• Maximally connected digraphs
• Connectivity of cages
• Edge-superconnectivity of cages
• All (k;g)‐cages are edge‐superconnected

This page was built for publication: Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages