Walk entropy and walk-regularity

Kyle Kloster, Daniel Král', Blair D. Sullivan

A graph is said to be walk-regular if, for each $\ell \ge 1$, every vertex is contained in the same number of closed walks of length $\ell$. We construct a $24$-vertex graph $H_4$…