The Laplacian spectrum of a graph comprises the eigenvalues of its Laplacian matrix, a fundamental operator defined as the difference between the degree matrix and the adjacency matrix. This spectrum ...

This is a preview. Log in through your library . Abstract A non-backtracking walk on a graph, H, is a directed path of directed edges of H such that no edge is the inverse of its preceding edge.