✦ LIBER ✦

On the connectivity of -diamond-free vertex transitive graphs

✍ Scribed by Yingzhi Tian; Jixiang Meng; Zhao Zhang

Book ID: 113564739
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 228 KB
Volume: 160
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.11.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Isoperimetric Connectivity in Vertex-

On Isoperimetric Connectivity in Vertex-Transitive Graphs

✍ Hamidoune, Y. O.; Lladó, A. S.; Serra, O.; Tindell, R. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 241 KB

Super-Connectivity and Hyper-Connectivit

Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs

✍ Xiaodong Liang; Jixiang Meng; Zhao Zhang 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 78 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 connectivity of diamond-free grap

On the connectivity of diamond-free graphs

✍ Peter Dankelmann; Angelika Hellwig; Lutz Volkmann 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 147 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