Ara es mostren els items 1-1 de 1

• #### On k-Walk-Regular Graphs ﻿

(2008-08)
Article
Accés obert
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 ...