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. Non-backtracking walks of a given length can be counted using ...