✦ LIBER ✦

Asymptotic results regarding the number of walks in a graph

✍ Scribed by A Dress; I Gutman

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 256 KB
Volume: 16
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(03)80062-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The number of connected sparsely edged g

The number of connected sparsely edged graphs. III. Asymptotic results

✍ E. M. Wright 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

## Abstract The number of connected graphs on __n__ labeled points and __q__ lines (no loops, no multiple lines) is __f(n,q).__ In the first paper of this series I showed how to find an (increasingly complicated) exact formula for __f(n,n+k)__ for general __n__ and successive __k.__ The method woul

Some results about the interval number o

Some results about the interval number of a graph

✍ Christoph Maas 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Asymptotic Behavior of the Transition Pr

Asymptotic Behavior of the Transition Probability of a Random Walk on an Infinite Graph

✍ Motoko Kotani; Tomoyuki Shirai; Toshikazu Sunada 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 522 KB

Ideas cultivated in spectral geometry are applied to obtain an asymptotic property of a reversible random walk on an infinite graph satisfying a certain periodic condition. In the course of our argument, we employ perturbation theory for the maximal eigenvalues of twisted transition operator. As a r

The number of cycles in a hamilton graph

✍ Yongbing Shi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 523 KB

On the asymptotic behavior of the maximu

On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

✍ Lonc, Zbigniew; Parol, Krzysztof; Wojciechowski, Jacek M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 3 views

The following asymptotic estimation of the maximum number of spanning trees f k (n) in 2kregular circulant graphs ( k ú 1) on n vertices is the main result of this paper: )) , where