Back to Search
Start Over
On the maximal α-spectral radius of graphs with given matching number.
- Source :
-
Linear & Multilinear Algebra . Jul2023, Vol. 71 Issue 10, p1681-1690. 10p. - Publication Year :
- 2023
-
Abstract
- Let G n , β be the set of graphs of order n with given matching number β. Let D (G) be the diagonal matrix of the degrees of the graph G and A (G) be the adjacency matrix of the graph G. The largest eigenvalue of the nonnegative matrix A α (G) = α D (G) + A (G) is called the α-spectral radius of G. The graphs with maximal α-spectral radius in G n , β are completely characterized in this paper. In this way, we provide a general framework to attack the problem of extremal spectral radius in G n , β . More precisely, we generalize the known results on the maximal adjacency spectral radius in G n , β and the signless Laplacian spectral radius. [ABSTRACT FROM AUTHOR]
- Subjects :
- *NONNEGATIVE matrices
*LAPLACIAN matrices
*MATHEMATICAL bounds
*EIGENVALUES
Subjects
Details
- Language :
- English
- ISSN :
- 03081087
- Volume :
- 71
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- Linear & Multilinear Algebra
- Publication Type :
- Academic Journal
- Accession number :
- 164011936
- Full Text :
- https://doi.org/10.1080/03081087.2022.2071412