Nonregular graphs with a regular number of walks

MaRDI QIDQ2732634zbMATH OpenFDO

Authors Marc Paulhus, Bill Sands

Publication date 28 November 2001

Published in Bulletin of the Institute of Combinatorics and its Applications (Search for Journal in Brave)

zbMATH Keywords

walk of given length

Mathematics Subject Classification ID

Paths and cycles (05C38)

Review text

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\).

Recommendations

• The number of walks in a graph
• Walk entropy and walk-regularity
• Walks and regular integral graphs
• scientific article; zbMATH DE number 2121203
• Walk regular digraphs.

Cited in

(3)

• The number of walks in a graph
• scientific article; zbMATH DE number 818369 (Why is no real title available?)
• Integer sequences from walks in graphs

This page was built for publication: Nonregular graphs with a regular number of walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732634)