The number of equivalence classes of symmetric sign patterns

This paper shows that the number of sign patterns of totally non-zero symmetric nn-by-nn matrices, up to conjugation by permutation and signature matrices and negation, is equal to the number of unlabelled graphs on n vertices.