- Title
- All (k;g)-cages are edge-superconnected
- Creator
- Lin, Yuqing; Miller, Mirka; Balbuena, Camino; Marcote, Xavier
- Date
- 2006
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/45304
- Identifier
- vital:523
- Identifier
-
https://doi.org/10.1002/net.20092
- Identifier
- ISSN:0028-3045
- Abstract
- A (k;g)-cage is k-regular graph with girth g and with the least possible number of vertices. In this article we prove that (k;g)-cages are edge-superconnected if g is even. Earlier, Marcote and Balbuena proved that (k;g)-cages are edge-superconnected if g is odd [Networks 43 (2004), 54-59]. Combining our results, we conclude that all (k;g)-cages are edge-superconnected. © 2005 Wiley Periodicals, Inc.; C1
- Publisher
- Wiley
- Relation
- Networks Vol. 47, no. 2 (2006), p. 102-110
- Rights
- Copyright Wiley
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0802 Computation Theory and Mathematics; Connectivity; Edge connectivity; Edge-superconnected; Interconnection networks; Numerical methods; Graph theory
- Reviewed
- Hits: 1823
- Visitors: 1834
- Downloads: 1
| Thumbnail | File | Description | Size | Format |
|---|