Regular graphs having the same path layer matrix
Andrey A. Dobrynin · Journal of Graph Theory · 1990
Abstract The path layer matrix (or path degree sequence) of a graph G contains quantitative information about all paths in G. Elements (i,j) in this matrix is the number of simple paths in G having initial vertex v, and length j. For every r ≥ 3, pairs of nonisomorphic r‐regular graphs having the same path layer matrix are presented.