Improved lower bound for the vertex connectivity of \((\delta ;g)\)-cages (Q2568484)

From MaRDI portal
Revision as of 02:35, 12 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
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
    0 references
    0 references
    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
    0 references

    Identifiers