Maximum Spread of Kr‐Minor Free Graphs
Wang Wenyan, Lele Liu, Wang Yi · Journal of Graph Theory · 2026
ABSTRACT The spread of a graph is the difference between the largest and smallest eigenvalues of its adjacency matrix. In this paper, we investigate spread problems for graphs with excluded clique‐minors. We show that for sufficiently large , the ‐vertex ‐minor free graph with maximum spread is the join of a clique and an independent set, with and vertices, respectively.