Bounds on normalized Laplacian eigenvalues of graphs

Jianxi Li*, Ji Ming Guo, Wai Chee SHIU

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

21 Citations (Scopus)


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 languageEnglish
Article number316
JournalJournal of Inequalities and Applications
Issue number1
Publication statusPublished - 1 Dec 2014

Scopus Subject Areas

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

User-Defined Keywords

  • bound
  • largest eigenvalue
  • normalized Laplacian eigenvalue


Dive into the research topics of 'Bounds on normalized Laplacian eigenvalues of graphs'. Together they form a unique fingerprint.

Cite this