## 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
All (k;g)-cages are edge-superconnected
✍ Scribed by Yuqing Lin; Mirka Miller; C. Balbuena; X. Marcote
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 200 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A (k;g)‐cage is a 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. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(2), 102–110 2006
📜 SIMILAR VOLUMES
## Abstract A graph is said to be edge‐superconnected if each minimum edge‐cut consists of all the edges incident with some vertex of minimum degree. A graph __G__ is said to be a $\{d,d+1\}$‐semiregular graph if all its vertices have degree either __d__ or $d+1$. A smallest $\{d,d+1\}$‐semiregula
dult education is a field in which few rules survive the A harsh realities of experience. There is one that I call: The Rule of Universal Nonattraction. It states: If your program is one that everybody is interested in, no one will come. For example, a course in ethics. Everyone is concerned with ri