A graph’s spread is defined as the difference between the largest eigenvalue and the least eigenvalue of the graph’s adjacency matrix. Characterizing a graph with maximal spread is still a difficult problem. If we restrict the discussion to some classes of connected graphs of a prescribed order and size, it simplifies the problem and it may allow us to solve it. Here, we discuss some results on graphs whose spread is maximal in certain classes of graphs.