✦ LIBER ✦

Edge-superconnectivity of cages

✍ Scribed by X. Marcote; C. Balbuena

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 130 KB
Volume: 43
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge-superconnectivity of semiregular ca

Edge-superconnectivity of semiregular cages with odd girth

✍ C. Balbuena; D. González-moreno; J. Salas 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## 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

All (k;g)-cages are edge-superconnected

✍ Yuqing Lin; Mirka Miller; C. Balbuena; X. Marcote 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 200 KB

## 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‐superconnecte

On superconnectivity of (4,g)-cages with

On superconnectivity of (4,g)-cages with even girth

✍ Yuqing Lin; Hongliang Lu; Yunjian Wu; Qinglin Yu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

Edge 47 The Moving Cage

✍ George G. Gilman 📂 Fiction 📅 2017 🏛 NEL 🌐 English ⚖ 152 KB 👁 1 views

All (k;g)-cages are k-edge-connected

✍ Yuqing Lin; Mirka Miller; Chris Rodger 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 116 KB 👁 1 views

## 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

Connectivity of cages

✍ Fu, H. L.; Huang, K. C.; Rodger, C. A. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB

A (k; g)-graph is a k-regular graph with girth g. Let f (k; g) be the smallest integer ν such there exists a (k; g)-graph with ν vertices. A (k; g)-cage is a (k; g)-graph with f (k; g) vertices. In this paper we prove that the cages are monotonic in that f (k; g 1 ) < f(k; g 2 ) for all k ≥ 3 and 3