Maximum spread of K₂,t-minor-free graphs
From MaRDI portal
Publication:6178786
Abstract: The spread of a graph is the difference between the largest and smallest eigenvalues of the adjacency matrix of . In this paper, we consider the family of graphs which contain no -minor. We show that for any , there is an integer such that the maximum spread of an -vertex -minor-free graph is achieved by the graph obtained by joining a vertex to the disjoint union of copies of and isolated vertices. The extremal graph is unique, except when and is an integer, in which case the other extremal graph is the graph obtained by joining a vertex to the disjoint union of copies of and isolated vertices. Furthermore, we give an explicit formula for .
Recommendations
Cites work
- Bicyclic graphs for which the least eigenvalue is minimum
- Cacti whose spread is maximal
- Inequalities for Graph Eigenvalues
- Maximum spread of graphs and bipartite graphs
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- On the spectral spread of bicyclic graphs with given girth
- On the spread of outerplanar graphs
- On the spread of the spectrum of a graph
- Spectra of graphs
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
- The Colin de Verdière parameter, excluded minors, and the spectral radius
- The edge-density for \(K_{2,t}\) minors
- The extremal function for unbalanced bipartite minors
- The largest eigenvalue of a graph: A survey
- The spectral radius of a planar graph
- The spectral radius of graphs with no \(k_{2,t}\) minor
- The spread of the spectrum of a graph
- The spread of the unicyclic graphs
- The spread of unicyclic graphs with given size of maximum matchings
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
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)