Back to Search
Start Over
A note on the bounds for the spectral radius of graphs.
- Source :
-
Linear Algebra & its Applications . Jun2023, Vol. 667, p1-9. 9p. - Publication Year :
- 2023
-
Abstract
- Let G = (V , E) be a finite undirected graph of order n and of size m. Let Δ and δ be the largest and the smallest degree of G , respectively. The spectral radius of G is the largest eigenvalue of the adjacency matrix of the graph G. In this note we give new bounds on the spectral radius of { C 3 , C 4 } -free graphs in terms of m , n , Δ and δ. Computer search shows that in most of the cases the bounds derived in this note are better than the existing bounds. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00243795
- Volume :
- 667
- Database :
- Academic Search Index
- Journal :
- Linear Algebra & its Applications
- Publication Type :
- Academic Journal
- Accession number :
- 162894058
- Full Text :
- https://doi.org/10.1016/j.laa.2023.02.021