On the maximum spread of planar and outerplanar graphs

Zelong Li, William Linz, Linyuan Lu +1

The spread of a graph $G$ is the difference between the largest and smallest eigenvalue of the adjacency matrix of $G$. Gotshall, O'Brien and Tait conjectured that for sufficiently…