Characterization of graphs with an eigenvalue of large multiplicity (Q2246527)

Let \(G\) be an \(n\)-vertex simple connected graph. The adjacency matrix of \(G\) is defined as an \(n\times n\) matrix \(A(G)=(a_{ij})\) whose \(a_{ij}=1\) if and only if \(v_i\) and \(v_j\) are adjacent. The eigenvalues of \(A(G)\) are called the eigenvalues of \(G\). In the paper under review, the authors identified all the \(n\)-vertex graphs with some eigenvalue of multiplicity \(n - 2\) (resp. \(n- 3\)). As an application of this main result, the authors constructed a family of nonregular graphs with four distinct eigenvalues.