Maximum spread of $K_r$-minor free graphs
Combinatorics
2024-11-07 v1
Abstract
The spread of a graph is the difference between the largest and smallest eigenvalue 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.
Keywords
Cite
@article{arxiv.2411.04014,
title = {Maximum spread of $K_r$-minor free graphs},
author = {Wenyan Wang and Lele Liu and Yi Wang},
journal= {arXiv preprint arXiv:2411.04014},
year = {2024}
}