All (k;g)-cages are k-edge-connected | 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/25337

Title: All (k;g)-cages are k-edge-connected
Author/Creator: Lin, Yuqing; Miller, M.; Rodger, C.
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 prove that (k;g)-cages are k-edge-connected if g is even. Earlier, Wang, Xu, and Wang proved that (k;g)-cages are k-edge-connected if 9 is odd. Combining our results, we conclude that the (k;g)-cages are k-edge-connected. (C) 2005 Wiley Periodicals, Inc.
Relation: Journal of Graph Theory Vol. 48, no. 3, p. 219-227
Date: 2005
Publisher: John Wiley & Sons
Keyword(s): cages; (k; g); edge-connectivity; connectivity
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.13/25337
Identifier: ISSN:1097-0118
Language: eng

26 Visitors

35 Hits

NOVA. The University of Newcastle's Digital Repository