  We construct infinite families of graphs that are determined by their
generalized spectrum. This construction is based on new formulae for the
determinant of the walk matrix of a graph. The graphs constructed here all
satisfy a lower divisibility for the determinant of their walk matrix.

Combinatorics