𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs

✍ Scribed by Yingzhi Tian; Jixiang Meng; Xiaodong Liang

Publisher
Springer Japan
Year
2011
Tongue
English
Weight
188 KB
Volume
28
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Edge Connectivity, Hamiltonicity,
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs
✍ Jan van den Heuvel; Bill Jackson πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 191 KB

Let G be a connected k-regular vertex-transitive graph on n vertices. For S V(G) let d(S) denote the number of edges between S and V(G)"S. We extend results of Mader and Tindell by showing that if d(S)< 2 9 (k+1) 2 for some S V(G) with 1 3 (k+1) |S| 1 2 n, then G has a factor F such that GΓ‚E(F ) is