Distance spectral radius of complete multipartite graphs and majorization
From MaRDI portal
Publication:2332406
DOI10.1016/j.laa.2019.08.021zbMath1426.05106OpenAlexW2971511248MaRDI QIDQ2332406
Publication date: 4 November 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.2019.08.021
Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Connectivity (05C40)
Related Items (9)
LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS ⋮ On a conjecture related to the smallest signless Laplacian eigenvalue of graphs ⋮ On the eccentricity spectra of complete multipartite graphs ⋮ Distance spectral radius of trees with given number of segments ⋮ Reverse Wiener spectral radius of trees ⋮ Unnamed Item ⋮ Chromatic number and signless Laplacian spectral radius of graphs ⋮ Maximal distance spectral radius of 4-chromatic planar graphs ⋮ On the smallest signless Laplacian eigenvalue of graphs
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
- 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
- A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization
- Distance spectra of graphs: a survey
- A new lower bound for the energy of graphs
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- Cospectrality of complete bipartite graphs
- Bipartite graphs with at most six non-zero eigenvalues
- On spectral radius and energy of complete multipartite graphs
- Distance integral complete r-partite graphs
- Characterization of graphs with exactly two non-negative eigenvalues
- Remarks on D-integral complete multipartite graphs
- Inequalities: theory of majorization and its applications
- On the spectral radius of trees
This page was built for publication: Distance spectral radius of complete multipartite graphs and majorization