✦ LIBER ✦

On interesting walks in a graph

✍ Scribed by Witold Brostow; Andrzej Schinzel

Publisher: Springer
Year: 1972
Tongue: English
Weight: 253 KB
Volume: 4
Category: Article
ISSN: 0022-4715
DOI: 10.1007/bf01008546

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Restricted random walks on a graph

✍ F. Y. Wu; H. Kunz 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 338 KB

Random walks on a finite oriented graph

✍ S. V. Troyanovskii; V. R. Krasheninnikov 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 291 KB

Enumeration of acyclic walks in a graph

✍ Darko Babić; Ante Graovac 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 436 KB

The number of walks in a graph

✍ A Dress; I Gutman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 349 KB

The aim of this note is to call attention to a simple regularity regarding the number of walks in a finite graph G. Let wk denote the number of walks of length k(> 0) in G. Then Wi+,, 5 W&Wzb holds for all a, b E NJ while equality holds exclusively either (I) for all a, b E No (in case G is a regula

A note on recurrent random walks on grap

A note on recurrent random walks on graphs

✍ András Telcs 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 240 KB

Asymptotic results regarding the number

Asymptotic results regarding the number of walks in a graph

✍ A Dress; I Gutman 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 256 KB