3 research outputs found

    Directed strongly walk-regular graphs

    Full text link
    We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly β„“\ell-walk-regular with β„“>1\ell >1 if the number of walks of length β„“\ell from a vertex to another vertex depends only on whether the two vertices are the same, adjacent, or not adjacent. This generalizes also the well-studied strongly regular digraphs and a problem posed by Hoffman. Our main tools are eigenvalue methods. The case that the adjacency matrix is diagonalizable with only real eigenvalues resembles the undirected case. We show that a digraph Ξ“\Gamma with only real eigenvalues whose adjacency matrix is not diagonalizable has at most two values of β„“\ell for which Ξ“\Gamma can be strongly β„“\ell-walk-regular, and we also construct examples of such strongly walk-regular digraphs. We also consider digraphs with nonreal eigenvalues. We give such examples and characterize those digraphs Ξ“\Gamma for which there are infinitely many β„“\ell for which Ξ“\Gamma is strongly β„“\ell-walk-regular

    Directed strongly walk-regular graphs

    No full text
    We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly β„“ -walk-regular with β„“>1 if the number of walks of length β„“ from a vertex to another vertex depends only on whether the first vertex is the same as, adjacent to, or not adjacent to the second vertex. This generalizes also the well-studied strongly regular digraphs and a problem posed by Hoffman. Our main tools are eigenvalue methods. The case that the adjacency matrix is diagonalizable with only real eigenvalues resembles the undirected case. We show that a digraph Ξ“ with only real eigenvalues whose adjacency matrix is not diagonalizable has at most two values of β„“ for which Ξ“ can be strongly β„“ -walk-regular, and we also construct examples of such strongly walk-regular digraphs. We also consider digraphs with non-real eigenvalues. We give such examples and characterize those digraphs Ξ“ for which there are infinitely many β„“ for which Ξ“ is strongly β„“ -walk-regular
    corecore