Graphs with three distinct eigenvalues and largest eigenvalue less than 8

In this paper we consider graphs with three distinct eigenvalues and, we characterize those with the largest eigenvalue less than 8. We also prove a simple result which gives an upper bound on the number of vertices of graphs with a given number of distinct eigenvalues in terms of the largest eigenvalue.