Ordering graphs by their largest (least) Aα-eigenvalues
From MaRDI portal
Publication:5888886
DOI10.1080/03081087.2021.1981811OpenAlexW3201741181MaRDI QIDQ5888886
Publication date: 25 April 2023
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081087.2021.1981811
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Ordered sets (06A99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New method and new results on the order of spectral radius
- Ordering (signless) Laplacian spectral radii with maximum degrees of graphs
- Ordering trees by their spectral radii
- Ordering graphs with cut edges by their spectral radii
- On the \(A_{\alpha}\)-spectra of trees
- A note on (signless) Laplacian spectral ordering with maximum degrees of graphs
- Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
- On the two largest eigenvalues of trees
- Ordering graphs with small index and its application
- On the \(A_\alpha\)-spectra of graphs
- Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees
- On the least eigenvalue of \(A_\alpha \)-matrix of graphs
- Corrigendum to: ``A note on (signless) Laplacian spectral ordering with maximum degrees of graphs
- Spectral ordering of trees with small index
- Orderingn-vertex cacti with matching numberqby their spectral radii
- Merging the A-and Q-spectral theories
- Spectral radius ordering of starlike trees
- Inequalities for Graph Eigenvalues
- Ordering trees by their largest eigenvalues
This page was built for publication: Ordering graphs by their largest (least) Aα-eigenvalues
