Majorization and the spectral radius of starlike trees
From MaRDI portal
Publication:724741
DOI10.1007/s10878-018-0287-5zbMath1393.05182OpenAlexW2801582307MaRDI QIDQ724741
Publication date: 26 July 2018
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0287-5
Trees (05C05) Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS, Ordering starlike trees by the totality of their spectral moments, Energy of graphs with no eigenvalue in the interval \((-1,1)\), Reverse Wiener spectral radius of trees, A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization, Chromatic number and signless Laplacian spectral radius of graphs, A new lower bound for the energy of graphs, On the smallest signless Laplacian eigenvalue of graphs, Distance spectral radius of complete multipartite graphs and majorization
Cites Work
- On the third largest eigenvalue of graphs
- Locating the eigenvalues of trees
- Bounds on the (Laplacian) spectral radius of graphs
- Majorization and the Lorenz order: a brief introduction
- On the spectral radius of graphs
- On the eigenvalues and spectral radius of starlike trees
- The spectral radius of trees on \(k\) pendant vertices
- Some new bounds on the spectral radius of graphs
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- On the eigenvalues of trees
- Cospectrality of complete bipartite graphs
- Bipartite graphs with at most six non-zero eigenvalues
- On spectral radius and energy of complete multipartite graphs
- Characterization of graphs with exactly two non-negative eigenvalues
- On the spectral radius of trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
