𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Superconnectivity of graphs with odd girth and even girth

✍ Scribed by C. Balbuena; P. García-Vázquez; L.P. Montejano

Book ID
108112903
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
285 KB
Volume
159
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the -optimality in graphs with odd gi
On the -optimality in graphs with odd girth and even girth
✍ C. Balbuena; P. García-Vázquez; L.P. Montejano; J. Salas 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 222 KB

## a b s t r a c t For a connected graph G, the restricted edge-connectivity λ ′ (G) is defined as the minimum cardinality of an edge-cut over all edge-cuts S such that there are no isolated vertices in }, d(u) denoting the degree of a vertex u. The main result of this paper is that graphs with od

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

Smallest regular graphs with prescribed
Smallest regular graphs with prescribed odd girth
✍ Guo-Hui Zhang 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 484 KB 👁 1 views

## Abstract The odd girth of a graph __G__ gives the length of a shortest odd cycle in __G.__ Let __f(k,g)__ denote the smallest __n__ such that there exists a __k__‐regular graph of order __n__ and odd girth __g.__ The exact values of __f(k,g)__ are determined if one of the following holds: __k__

4-chromatic graphs with large odd girth
4-chromatic graphs with large odd girth
✍ Nguyen Van Ngoc; Zsolt Tuza 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lov~sz. The proof presented here is elementary combinatorial.