✦ LIBER ✦

A Note onk-walks in Bridgeless Graphs

✍ Scribed by Tomáš Kaiser; Roman Kužel; Hao Li; Guanghui Wang

Publisher: Springer Japan
Year: 2007
Tongue: English
Weight: 201 KB
Volume: 23
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-007-0733-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note onk-Connected Rayless Graphs

✍ Rudolf Halin 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 160 KB

In this note a short new proof of Diestel's characterization theorem for infinite k-connected rayless graphs is given, using the concept of the order of a rayless graph which was introduced by R. Schmidt. 1998 Academic Press Diestel [3, Theorem 4.3] gives a beautiful description of the structure of

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

Disconnected 2-Factors in Planar Cubic B

Disconnected 2-Factors in Planar Cubic Bridgeless Graphs

✍ Ajit A. Diwan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 97 KB

On interesting walks in a graph

✍ Witold Brostow; Andrzej Schinzel 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 253 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