Maximum spread of $K_r$-minor free graphs
Authors:
Preprint
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 $n$, the $n$-vertex $K_r$-minor free graph with maximum spread is the join of a clique and an independent set, with $r-2$ and $n-r+2$ vertices, respectively.
Keywords
All Related Versions
This publication has 26 references indexed in Scilit:
- On the maximum second eigenvalue of outerplanar graphsDiscrete Mathematics, 2025
- A complete solution to the Cvetković–Rowlinson conjectureJournal of Graph Theory, 2021
- On the spectral spread of bicyclic graphs with given girthActa Mathematicae Applicatae Sinica, English Series, 2013
- The spread of the unicyclic graphsEuropean Journal of Combinatorics, 2010
- Disjoint complete minors and bipartite minorsEuropean Journal of Combinatorics, 2007
- The spread of unicyclic graphs with given size of maximum matchingsJournal of Mathematical Chemistry, 2006
- The Spectral Radius of Graphs on SurfacesJournal of Combinatorial Theory, Series B, 2000
- The spectral radius of a planar graphLinear Algebra and its Applications, 1993
- Lower bounds for the spread of a matrixLinear Algebra and its Applications, 1985
- Homomorphieeigenschaften und mittlere Kantendichte von GraphenMathematische Annalen, 1967