Document Type

Article

Publication Date

1-1-2025

Abstract

The spread of a graph G is the difference between the largest and smallest eigenvalue of the adjacency matrix of G. In this paper, we consider the family of graphs which contain no Ks,t-minor. We show that for any t ≥ s ≥ 2 and sufficiently large n, there is an integer ξt such that the extremal n-vertex Ks,t-minor-free graph attaining the maximum spread is the graph obtained by joining a graph L on (s −1) vertices to the disjoint union of (Formula Presented) copies of Kt and (Formula Presented) isolated vertices. Furthermore, we give an explicit formula for ξt and an explicit description for the graph (Formula Presented).

Publication Source (Journal or Book title)

Electronic Journal of Combinatorics

Download

Share

COinS