On the Aα-spectral radius of connected graphs
DOI10.26493/1855-3974.2697.43azbMath1505.05081OpenAlexW4293068625MaRDI QIDQ5056833
Hilal A. Ganie, Maryam Baghipur, Abdollah Alhevaz, Kinkar Chandra Das
Publication date: 8 December 2022
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.2697.43a
spectral radiusindependence numberadjacency matrixclique numberdegree sequencesignless Laplacian matrixgeneralized adjacency matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items
Cites Work
- Spectra of graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Graphs determined by their \(A_\alpha\)-spectra
- On the \(A_{\alpha}\)-characteristic polynomial of a graph
- On the \(\alpha\)-index of graphs with pendent paths
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- Maximizing the sum of the squares of the degrees of a graph
- Interlacing eigenvalues and graphs
- Some results on the bounds of signless Laplacian eigenvalues
- Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees
- On the eigenvalues of \(A_\alpha \)-matrix of graphs
- On the least eigenvalue of \(A_\alpha \)-matrix of graphs
- The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix
- The \(A_\alpha \)-spectral radius of trees and unicyclic graphs with given degree sequence
- On the multiplicity of \(\alpha\) as an eigenvalue of the \(a_\alpha\) matrix of a graph in terms of the number of pendant vertices
- Laplacian spectral bounds for clique and independence numbers of graphs
- The perturbed laplacian matrix of a graph
- Matrix Analysis
- Merging the A-and Q-spectral theories
- On graphs with exactly two positive eigenvalues
- On graphs with the smallest eigenvalue at least −1 − √2, part III
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Characterization of graphs with exactly two non-negative eigenvalues
- Aα-spectral radius and measures of graph irregularity
