A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization
From MaRDI portal
Publication:1736217
DOI10.1016/j.laa.2018.12.012zbMath1415.05085OpenAlexW2905356518WikidataQ128739255 ScholiaQ128739255MaRDI QIDQ1736217
Publication date: 26 March 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2018.12.012
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (11)
LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS ⋮ Seidel energy of complete multipartite graphs ⋮ On a conjecture related to the smallest signless Laplacian eigenvalue of graphs ⋮ On the eccentricity spectra of complete multipartite graphs ⋮ Refinement on Spectral Turán’s Theorem ⋮ Reverse Wiener spectral radius of trees ⋮ Unnamed Item ⋮ Chromatic number and signless Laplacian spectral radius of graphs ⋮ On the smallest signless Laplacian eigenvalue of graphs ⋮ Normalized Laplacian spectrum of complete multipartite graphs ⋮ Distance spectral radius of complete multipartite graphs and majorization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the third largest eigenvalue of graphs
- Majorization for partially ordered sets
- The Laplacian energy of threshold graphs and majorization
- Signless Laplacian spectral radii of graphs with given chromatic number
- Locating the eigenvalues of trees
- Spectra of graphs
- Majorization and the spectral radius of starlike 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
- 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
- Inequalities: theory of majorization and its applications
- On the spectral radius of trees
This page was built for publication: A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization