Considering a connected graph $G$ with diameter $D$, we say that it
is \emph{$k$-walk-regular}, for a given integer $k$ $(0\leq k \leq
D)$, if the number of walks of length $\ell$ between vertices $u$
and $v$ only depends ...