Upper and lower bounds are obtained for the spread λ1-λn of the eigenvalues λ1≥λ2≥≥λn of the adjacency matrix of a simple graph. © 2001 Elsevier Science Inc.
Gregory, D., Hershkowitz, D., & Kirkland, S. (2001). The spread of the spectrum of a graph. Linear Algebra and Its Applications, 332–334, 23–35. https://doi.org/10.1016/S0024-3795(00)00086-0