Now showing items 1-1 of 1

  • On k-Walk-Regular Graphs 

    Dalfó Simó, Cristina; Fiol Mora, Miquel Àngel; Garriga Valle, Ernest (2008-08)
    Open Access
    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 ...