The adjacency matrix of a two-graph is the adjacency matrix of the corresponding signed complete graph; thus it is symmetric, is zero on the diagonal, and has entries ±1 off the diagonal.
If graphs G and H are in a same switching class, the multisets of eigenvalues of the two Seidel adjacency matrices of G and H coincide, since the matrices are similar [REF].