Graphs that allow all the eigenvalue multiplicities to be even

Let G be an undirected graph on n   vertices and let S(G)S(G) be the set of all n×nn×n real symmetric matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The Inverse Eigenvalue Problem for a graph G   is a problem of determining all possible lists that can occur as the lists of eigenvalues of matrices in S(G)S(G). This question is, in general, hard to answer and several variations were studied, most notably the minimum rank problem. In this paper we introduce the problem of determining for which graphs G   there exists a matrix in S(G)S(G) whose characteristic polynomial is a square, i.e. the multiplicities of all its eigenvalues are even. We solve this question for several families of graphs.