✦ LIBER ✦

On the number of closed walks in vertex-transitive graphs

✍ Scribed by Robert Jajcay; Aleksander Malnič; Dragan Marušič

Book ID: 108113577
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 192 KB
Volume: 307
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.09.039

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random walks on the triangular prism and

Random walks on the triangular prism and other vertex-transitive graphs

✍ A.R.D. van Slijpe 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 703 KB

The Hadwiger number of infinite vertex-t

The Hadwiger number of infinite vertex-transitive graphs

✍ Carsten Thomassen 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 679 KB

On the connectivity of -diamond-free ver

On the connectivity of -diamond-free vertex transitive graphs

✍ Yingzhi Tian; Jixiang Meng; Zhao Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Some results on the lexicographic produc

Some results on the lexicographic product of vertex-transitive graphs

✍ Feng Li; Wei Wang; Zongben Xu; Haixing Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 196 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

Inequalities for the Number of Walks in

Inequalities for the Number of Walks in Graphs

✍ Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke… 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 788 KB