Hadamard diagonalizable graphs of order at most 36

Jane Breen, Steve Butler, Melissa Fuentes +7

If the Laplacian matrix of a graph has a full set of orthogonal eigenvectors with entries $\pm 1$, then the matrix formed by taking the columns as the eigenvectors is a Hadamard mat…