On the spread of the spectrum of a graph

Some new upper bounds and lower bounds are obtained for the spread λ1−λnλ1−λn of the eigenvalues λ1≥λ2≥⋯≥λnλ1≥λ2≥⋯≥λn of the adjacency matrix of a simple graph.