✦ LIBER ✦

Matrix power inequalities and the number of walks in graphs

✍ Scribed by Täubig, Hanjo; Weihmann, Jeremias

Book ID: 122505570
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 326 KB
Volume: 176
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.10.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

On the number of closed walks in vertex-

On the number of closed walks in vertex-transitive graphs

✍ Robert Jajcay; Aleksander Malnič; Dragan Marušič 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 192 KB

Inequalities between the domination numb

Inequalities between the domination number and the chromatic number of a graph

✍ Dieter Gernert 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Upper bounds for u + x and ax are proved, where u is the domination number and x the chromatic number of a graph.

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

Frequency of even and odd numbers in dis

Frequency of even and odd numbers in distance matrixes of bipartite graphs

✍ Gutman, Ivan 📂 Article 📅 1994 🏛 American Chemical Society 🌐 English ⚖ 282 KB