On the two largest eigenvalues of trees
From MaRDI portal
Very little is known about upper bounds for the largest eigenvalue of a tree that depend only on the number of vertices. Starting from the classical upper bound for the largest eigenvalue, some refinements can be obtained by successively removing trees from consideration. The results can be used to characterize those trees that maximise the second largest eigenvalue. This corrects a result in the literature, and it includes a proof of a conjecture of Neumaier. The main tool for this endeavour is the theory of partial eigenvectors.
Recommendations
Cites work
Cited in
(48)- The spread of the unicyclic graphs
- On the largest eigenvalues of bipartite graphs which are nearly complete
- Bounds on the largest eigenvalues of trees with a given size of matching
- Ordering graphs with small index and its application
- The spectral radius of trees on \(k\) pendant vertices
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- On the largest eigenvalues of trees
- The multiplicity of eigenvalues of trees
- Upper bounds on the smallest positive eigenvalue of trees with at most one zero eigenvalue
- The maximum -spectral radius and the majorization theorem of k-uniform supertrees
- Ordering trees and graphs with few cycles by algebraic connectivity
- An explicit formula for eigenvalues of Bethe trees and upper bounds on the largest eigenvalue of any tree
- The \(\alpha \)-spectral radius of general hypergraphs
- Upper bounds on the smallest positive eigenvalue of trees
- scientific article; zbMATH DE number 5952367 (Why is no real title available?)
- scientific article; zbMATH DE number 5079740 (Why is no real title available?)
- A result related to the largest eigenvalue of a tree
- scientific article; zbMATH DE number 1150013 (Why is no real title available?)
- scientific article; zbMATH DE number 1930773 (Why is no real title available?)
- Bounds on the ABC spectral radius of a tree
- scientific article; zbMATH DE number 5199182 (Why is no real title available?)
- More on the Estrada indices of trees
- scientific article; zbMATH DE number 7070668 (Why is no real title available?)
- The second largest eigenvalue of trees
- On the largest eigenvalues of trees with perfect matchings
- On the multiple eigenvalue of Randić matrix of trees
- Ordering graphs by their largest (least) Aα-eigenvalues
- Ordering trees by their largest eigenvalues
- Ordering trees by their largest eigenvalues
- On the spectral radius of trees
- Ordering of some uniform supertrees with larger spectral radii
- The first three largest values of the spectral norm of oriented bicyclic graphs
- Extremal problems for the eccentricity matrices of complements of trees
- Ordering trees by -index
- Reciprocal distance Laplacian spectral properties double stars and their complements
- Ordering unicyclic graphs in terms of their smaller least eigenvalues
- On distance Laplacian spectral ordering of some graphs
- On spectral irregularity of graphs
- On ABC spectral radius of uniform hypergraphs
- On the second largest adjacency eigenvalue of trees with given diameter
- On the maximum second eigenvalue of outerplanar graphs
- On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree
- Ordering uniform supertrees by their spectral radii
- On the spectral radius of atom-bond maximum degree-based sum-connectivity matrix and its applications as molecular descriptors
- Coxeter energy of graphs
- On the spectral radius of trees with fixed diameter
- The spectra of some trees and bounds for the largest eigenvalue of any tree
- Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree
This page was built for publication: On the two largest eigenvalues of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361770)
