Connected regular graph with two adjacency eigenvalues

A connected regular graph has exactly two distinct adjacency eigenvalues if and only if it is a complete graph $K_n$ with $n\ge 2$. Its eigenvalues are $n-1$ on the constant vectors and $-1$ on their orthogonal complement.