Back to Search
Start Over
A New Result on Spectral Radius and Maximum Degree of Irregular Graphs.
- Source :
-
Graphs & Combinatorics . May2021, Vol. 37 Issue 3, p1103-1119. 17p. - Publication Year :
- 2021
-
Abstract
- Let G be a connected irregular graph on n vertices with maximum degree Δ and diameter D. The spectral radius of G, which is denoted by ρ (G) , is the largest eigenvalue of the adjacency matrix of G. In this paper, we study the lower bound of Δ - ρ (G) . As a result, a new lower bound is obtained which improves the known lower bounds of Δ - ρ (G) . [ABSTRACT FROM AUTHOR]
- Subjects :
- *GRAPH connectivity
*EIGENVALUES
*RADIUS (Geometry)
*MATHEMATICAL bounds
Subjects
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 37
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 150004019
- Full Text :
- https://doi.org/10.1007/s00373-021-02309-6