𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the connectivity of semiregular cages

✍ Scribed by C. Balbuena; D. González-Moreno; X. Marcote

Publisher
John Wiley and Sons
Year
2009
Tongue
English
Weight
186 KB
Volume
56
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

An ({r, r + 1}; g)‐cage is a graph with degree set {r, r + 1}, girth g, and with the smallest possible order; every such graph is called a semiregular cage. In this article, semiregular cages are shown to be maximally edge‐connected and 2‐connected. As a consequence, ({3, 4}; g)‐cages are proved to be maximally connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010

📜 SIMILAR VOLUMES

Connectivity of cages
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

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

Connectivity and separating sets of cage
Connectivity and separating sets of cages
✍ Jiang, Tao; Mubayi, Dhruv 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB

A (k; g)-cage is a graph of minimum order among k-regular graphs with girth g. We show that for every cutset S of a (k; g)-cage G, the induced subgraph G[S] has diameter at least g/2 , with equality only when distance g/2 occurs for at least two pairs of vertices in G[S]. This structural property is

cover
Cage on the Sea
✍ Ohno, Kaoru 📂 Fiction 📅 2014 🏛 Bento Books 🌐 English ⚖ 353 KB 👁 2 views

In late 1944, three Japanese military supply ships near the tiny South Pacific island of Anatahan came under American air attack. The ships were sunk and their crews left stranded on the island. The survivorsignorant that the war was long overwere forgotten until 1950, when the Americans began makin

On the Connectivity of Graphs Embedded i
On the Connectivity of Graphs Embedded in Surfaces
✍ Michael D Plummer; Xiaoya Zha 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 376 KB

In a 1973 paper, Cooke obtained an upper bound on the possible connectivity of a graph embedded in a surface (orientable or nonorientable) of fixed genus. Furthermore, he claimed that for each orientable genus #>0 (respectively, nonorientable genus #Ä >0, #Ä {2) there is a complete graph of orientab