On the eigenvalues and spectral radius of starlike trees
From MaRDI portal
Publication:1662424
DOI10.1007/s00010-017-0533-4zbMath1432.05063OpenAlexW2791896491MaRDI QIDQ1662424
Publication date: 20 August 2018
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-017-0533-4
Trees (05C05) Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (max. 100)
LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS ⋮ 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 ⋮ A new lower bound for the energy of graphs ⋮ Majorization and the spectral radius of starlike trees ⋮ Distance spectral radius of complete multipartite graphs and majorization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the third largest eigenvalue of graphs
- Locating the eigenvalues of trees
- Starlike trees are determined by their Laplacian spectrum
- Some new bounds on the spectral radius of graphs
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Some results on starlike and sunlike graphs
- On the eigenvalues of trees
- Spectral characterization of line graphs of starlike trees
- Cospectrality of complete bipartite graphs
- Bipartite graphs with at most six non-zero eigenvalues
- Starlike trees with maximum degree 4 are determined by their signless Laplacian spectra
- On spectral radius and energy of complete multipartite graphs
- Small graphs with exactly two non-negative eigenvalues
- Characterization of graphs with exactly two non-negative eigenvalues
- No starlike trees are cospectral
This page was built for publication: On the eigenvalues and spectral radius of starlike trees
