Improved lower bound for the vertex connectivity of ([delta];g)-cages | NOVA. The University of Newcastle's Digital Repository

Home

Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/25369

Title: Improved lower bound for the vertex connectivity of ([delta];g)-cages
Author/Creator: Lin, Yuqing; Miller, Mirka; Balbuena, Camino
Description: A ([delta],g)-cage is a [delta]-regular graph with girth g and with the least possible number of vertices. We prove that all ([delta],g)-cages are r-connected with for g[greater-or-equal, slanted]7 odd. This result supports the conjecture of Fu, Huang and Rodger that all ([delta];g)-cages are [delta]-connected.
Relation: Discrete Mathematics Vol. 299, no. 1-3, p. 162-171
Date: 2005
Publisher: Elsevier
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/25369
Identifier: ISSN:0012-365X
Language: eng

8 Visitors

11 Hits

NOVA. The University of Newcastle's Digital Repository