Back to Search
Start Over
The Sharp Upper Bounds on the Aα-Spectral Radius of C4-Free Graphs and Halin Graphs.
- Source :
- Graphs & Combinatorics; Feb2022, Vol. 38 Issue 1, p1-13, 13p
- Publication Year :
- 2022
-
Abstract
- Let G be a simple undirected graph. For any real number α ∈ [ 0 , 1 ] , Nikiforov defined the A α -matrix of G as A α (G) = α D (G) + (1 - α) A (G) , where A(G) and D(G) are the adjacency matrix and the degree diagonal matrix of G respectively. The largest eigenvalue of A α (G) is called the A α -spectral radius of G. In this paper, we give sharp upper bounds on the A α -spectral radius of C 4 -free graphs and Halin graphs for α ∈ [ 1 / 2 , 1) respectively. [ABSTRACT FROM AUTHOR]
- Subjects :
- MATHEMATICAL bounds
REAL numbers
UNDIRECTED graphs
EIGENVALUES
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 38
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 154213364
- Full Text :
- https://doi.org/10.1007/s00373-021-02429-z