Diameter and connectivity of (D; g)-cages
From MaRDI portal
Publication:3008349
DOI10.1080/00207160.2010.504828zbMath1220.05068OpenAlexW1996244485MaRDI QIDQ3008349
Camino Balbuena, Xavier Marcote
Publication date: 15 June 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2010.504828
Related Items (3)
Monotonicity of the order of \((D;g)\)-cages ⋮ Constructions of bi-regular cages ⋮ Edge-superconnectivity of semiregular cages with odd girth
Cites Work
- 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
- Constructions of bi-regular cages
- Sufficient conditions for maximally connected dense graphs
- Graphs with prescribed degree sets and girth
- On cages with given degree sets
- \((k,g)\)-cages are 3-connected
- The Moore bound for irregular graphs
- On the order and size of \(s\)-geodetic digraphs with given connectivity
- The minimum number of vertices with girth 6 and degree set \(D=\{r,m\}\)
- On the order of \((\{r,m\};g)\)-cages of even girth
- 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
- Superconnected digraphs and graphs with small conditional diameters
This page was built for publication: Diameter and connectivity of (D; g)-cages
