✦ LIBER ✦

RANDOM WALKS ON REGULAR POLYHEDRA AND OTHER DISTANCE–REGULAR GRAPHS

✍ Scribed by A.R.D. van Slijpe

Book ID: 115224840
Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 709 KB
Volume: 38
Category: Article
ISSN: 0039-0402
DOI: 10.1111/j.1467-9574.1984.tb01118.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Walks on Graphs with Regular Volu

Random Walks on Graphs with Regular Volume Growth

✍ T. Coulhon; A. Grigoryan 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 633 KB

Rates of convergence of random walk on d

Rates of convergence of random walk on distance regular graphs

✍ Eric David Belsley 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 306 KB

Rumor spreading on random regular graphs

Rumor spreading on random regular graphs and expanders

✍ Nikolaos Fountoulakis; Konstantinos Panagiotou 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Critical window for the vacant set left

Critical window for the vacant set left by random walk on random regular graphs

✍ Jiří Černý; Augusto Teixeira 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 248 KB

On the independence and chromatic number

On the independence and chromatic numbers of random regular graphs

✍ A.M Frieze; T Łuczak 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 399 KB

A remark on the intersection arrays of d

A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameterd= 3i− 1 withbi= 1 andk> 2

✍ E. W. Lambeck 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 250 KB

Let [' be a distance regular graph with intersection array {bo, bl, . •., bd\_l; ct, ..., ed}. It is shown that in same cases (c i 1, ai-I, br I) = (ct, at, bt) and (c2~ t, a2~ 1, b2i l) = (ci, a~, bi) imply k <\_ 2b i + 1. As a corollary all distance regular graphs of diameter d = 3i -1 with b I =