✦ LIBER ✦

On cyclic edge-connectivity of transitive graphs

✍ Scribed by Bing Wang; Zhao Zhang

Book ID: 108114131
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 720 KB
Volume: 309
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2009.02.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super cyclically edge connected transiti

Super cyclically edge connected transitive graphs

✍ Zhao Zhang; Bing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 494 KB

Super restricted edge-connectivity of ve

Super restricted edge-connectivity of vertex-transitive graphs

✍ Ying Qian Wang 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 163 KB

On Super Restricted Edge Connectivity of

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs

✍ Yingzhi Tian; Jixiang Meng; Xiaodong Liang 📂 Article 📅 2011 🏛 Springer Japan 🌐 English ⚖ 188 KB

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

Uniform cyclic edge connectivity in cubi

Uniform cyclic edge connectivity in cubic graphs

✍ R. E. L. Aldred; D. A. Holton; Bill Jackson 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 672 KB

Random walks on edge transitive graphs

✍ JoséLuis Palacios; JoséMiguel Renom 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 337 KB

We find explicit values for the expected hitting times between neighboring vertices of random walks on edge-transitive graphs, extending prior results and allowing the computation of sharp upper and lower bounds for the expected cover times of those graphs.