Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages (Q2568484): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2004.07.024 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2169093251 / rank | |||
Normal rank | |||
Revision as of 02:48, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages |
scientific article |
Statements
Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages (English)
0 references
10 October 2005
0 references
A \((\delta,g)\)-cage is a \(\delta\)-regular graph with girth \(g\) and with the minimum possible number of vertices. \textit{H. L. Fu}, \textit{K. C. Huang} and \textit{C. A. Rodger} [J. Graph Theory 24, 187--191 (1997; Zbl 0866.05035)] conjectured that all \((\delta,g)\)-cages are \(\delta\)-connected. Here the authors prove that all \((\delta,0)\)-cages are \(r\)-connected with \(r\geq\sqrt{\delta+1}\) for \(g\geq 7\) odd.
0 references
