Abstract

The spread of a graph is the difference between the largest and smallest eigenvalue of its adjacency matrix. In this talk,  we will present some new progress on this topic.