Maximum spread of K₂,t-minor-free graphs

From MaRDI portal
Publication:6178786




Abstract: The spread of a graph G is the difference between the largest and smallest eigenvalues of the adjacency matrix of G. In this paper, we consider the family of graphs which contain no K2,t-minor. We show that for any tgeq2, there is an integer xit such that the maximum spread of an n-vertex K2,t-minor-free graph is achieved by the graph obtained by joining a vertex to the disjoint union of lfloorfrac2n+xit3tfloor copies of Kt and n1tlfloorfrac2n+xit3tfloor isolated vertices. The extremal graph is unique, except when tequiv4mod12 and frac2n+xit3t is an integer, in which case the other extremal graph is the graph obtained by joining a vertex to the disjoint union of lfloorfrac2n+xit3tfloor1 copies of Kt and n1t(lfloorfrac2n+xit3tfloor1) isolated vertices. Furthermore, we give an explicit formula for xit.









This page was built for publication: Maximum spread of \(K_{2,t}\)-minor-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178786)