- Title
- All (k;g)-cages are k-edge-connected
- Creator
- Lin, Yuqing; Miller, Mirka; Rodger, Chris
- Date
- 2005
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/54322
- Identifier
- vital:524
- Identifier
-
https://doi.org/10.1002/jgt.20052
- Identifier
- ISSN:0364-9024
- Abstract
- 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 g is odd. Combining our results, we conclude that the (k;g)-cages are k-edge-connected. © 2005 wiley Periodicals, Inc.; C1
- Publisher
- Wiley
- Relation
- Journal of Graph Theory Vol. 48, no. 3 (2005), p. 219-227
- Rights
- Copyright Wiley
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0101 Pure Mathematics; (k,g)-cage; Connectivity; Edge-connectivity; Algorithms; Number theory; Set theory; Theorem proving; Graph theory
- Reviewed
- Hits: 2810
- Visitors: 2855
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|