Monotonicity of the order of \((D;g)\)-cages
From MaRDI portal
Publication:654223
DOI10.1016/j.aml.2011.05.024zbMath1234.05060OpenAlexW1608325169MaRDI QIDQ654223
Xavier Marcote, Camino Balbuena
Publication date: 28 December 2011
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2011.05.024
Related Items (2)
Cites Work
- On the connectivity of cages with girth five, six and eight
- Constructions of bi-regular cages
- Graphs with prescribed degree sets and girth
- On cages with given degree sets
- \((k,g)\)-cages are 3-connected
- The minimum number of vertices with girth 6 and degree set \(D=\{r,m\}\)
- Dynamic cage survey
- 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
- Diameter and connectivity of (D; g)-cages
- Cages—a survey
- Degree sets for graphs
- Connectivity of cages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Monotonicity of the order of \((D;g)\)-cages
