The Graphs for which the Maximum Multiplicity of an Eigenvalue is Two

Charles R. Johnson, Raphael Loewy, Paul Anthony Smith

Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partia…