On the connectivity of (k, g)-cages of even girth | NOVA. The University of Newcastle's Digital Repository

Home

Description	Size	Format
Author final version	182 KB	Adobe Acrobat PDF	View/Open

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

Title: On the connectivity of (k, g)-cages of even girth
Author/Creator: Lin, Yuqing; Balbuena, Camino; Marcote, Xavier; Miller, Mirka
Institution: The University of Newcastle. Faculty of Engineering & Built Environment, School of Electrical Engineering and Computer Science
Description: A (k,g)-cage is a k-regular graph with girth g and with the least possible number of vertices. In this paper we give a brief overview of the current results on the connectivity of (k,g)-cages and we improve the current known best lower bound on the vertex connectivity of (k,g)-cages for g even.
Relation: Discrete Mathematics Vol. 308, Issue 15, p. 3249-3256
Publisher Link: http://dx.doi.org/10.1016/j.disc.2007.06.030
Date: 2008
Publisher: Elsevier
Keyword(s): (k,g)-cage; connectivity; vertex connectivity
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/43387
Identifier: ISSN:0012-365X

13 Visitors

18 Hits

NOVA. The University of Newcastle's Digital Repository