Speaker: Lincoln Lu (University of South Carolina)
Title: On the maximum spread of outerplanar, planar, and K_{s,t}-minor-free graphs
Abstract:
The spread of a graph G is the difference between the largest and smallest eigenvalue of the adjacency matrix of G. In this talk, we consider several families of graphs, including outerplanar, planar, and K_{s,t}-minor-free graphs. We will identify the extremal graphs with the maximum spread within these families. This is joint work with William Linz, Zhiyu Wang, and Zelong Li.
