Abstract
Let G be a simple connected graph of order n, where [InlineEquation not available: see fulltext.]. Its normalized Laplacian eigenvalues are [InlineEquation not available: see fulltext.]. In this paper, some new upper and lower bounds on [InlineEquation not available: see fulltext.] are obtained, respectively. Moreover, connected graphs with [InlineEquation not available: see fulltext.] (or [InlineEquation not available: see fulltext.]) are also characterized.
MSC:05C50, 15A48.
| Original language | English |
|---|---|
| Article number | 316 |
| Journal | Journal of Inequalities and Applications |
| Volume | 2014 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 1 Dec 2014 |
User-Defined Keywords
- bound
- largest eigenvalue
- normalized Laplacian eigenvalue
Fingerprint
Dive into the research topics of 'Bounds on normalized Laplacian eigenvalues of graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver