Maximum spectral gaps of graphs

George Brooks, William Linz, Linyuan Lu

The spread of a graph $G$ is the difference ${\lambda }_1-{\lambda }_n$ between the largest and smallest eigenvalues of its adjacency matrix. Breen, Riasanovsky, Tait and Urschel recently determin…