The spread of a graph is the difference between the largest and most negative eigenvalue of its adjacency matrix. We show that for sufficiently large n, the n-vertex outerplanar graph with maximum spread is a vertex joined to a linear forest with Ω(n) edges. We conjecture that the extremal graph is a vertex joined to a path on n − 1 vertices.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.