The eigenvalues of a graph are algebraic integers in some algebraic extension of the rationals. We investigate the algebraic degree of these eigenvalues with respect to graph-theoretical properties. We obtain quantitative results showing that a graph with large diameter must have some eigenvalues of large algebraic degree.