Nonregular graphs with a regular number of walks (Q2732634)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1624787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonregular graphs with a regular number of walks |
scientific article; zbMATH DE number 1624787 |
Statements
28 November 2001
0 references
walk of given length
0 references
Nonregular graphs with a regular number of walks (English)
0 references
There is a unique nonregular graph \(G\) (a 7-vertex tree) such that there are exactly \(2^n\) walks in \(G\) of length \(n\) starting from a given vertex. Examples of nonregular graphs are given with \(d^n\) walks (\(d \geq 3\)) of length \(n\) for each \(n\).
0 references
0.8131220936775208
0 references
0.7388931512832642
0 references
0.7333580851554871
0 references
0.7175171375274658
0 references
