A new bound for the connectivity of cages

DOI10.1016/j.aml.2012.01.036zbMath1251.05084OpenAlexW2023097190MaRDI QIDQ712582

Julián Salas, Camino Balbuena

Publication date: 17 October 2012

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

Full work available at URL: https://doi.org/10.1016/j.aml.2012.01.036

zbMATH Keywords

girthcagevertex-connectivityvertex-cut

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (1)

Mixed cages: monotonicity, connectivity and upper bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the connectivity of cages with girth five, six and eight
• On the connectivity of \((k,g)\)-cages of even girth
• 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
• Dynamic cage survey
• Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages
• (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
• Cages—a survey
• Maximally connected digraphs
• Connectivity of cages

This page was built for publication: A new bound for the connectivity of cages