On the connectivity of cages with girth five, six and eight
From MaRDI portal
Publication:878639
DOI10.1016/J.DISC.2005.11.082zbMath1118.05054OpenAlexW2124506101MaRDI QIDQ878639
Ignacio M. Pelayo, 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.082
Related Items (14)
El problema de las jaulas y los polígonos generalizados ⋮ Monotonicity of the order of \((D;g)\)-cages ⋮ On the connectivity of \((k,g)\)-cages of even girth ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Diameter and connectivity of (D; g)-cages ⋮ Unnamed Item ⋮ A new bound for the connectivity of cages ⋮ On the connectivity of semiregular cages ⋮ The underlying line digraph structure of some (0, 1)-matrix equations ⋮ Small regular graphs of girth 7 ⋮ Rainbow connectivity of Moore cages of girth 6 ⋮ Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages ⋮ Rainbow connectivity using a rank genetic algorithm: Moore cages with girth six ⋮ On upper bounds and connectivity of cages
Cites Work
- On certain regular graphs of girth 5
- Graphs from projective planes
- \((k,g)\)-cages are 3-connected
- On the order and size of \(s\)-geodetic digraphs with given connectivity
- New upper bounds on the order of cages
- Every cubic cage is quasi 4-connected
- (\(\delta ,g\))-cages with \(g\geqslant 10\) are 4-connected
- Approximate formulas for some functions of prime numbers
- Cages—a survey
- Maximally connected digraphs
- Connectivity of cages
- Superconnected digraphs and graphs with small conditional diameters
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the connectivity of cages with girth five, six and eight
