Note on the laplacian estrada index of a graph

Jianxi Li*, Wai Chee Shiu, Wai Hong Chan

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

7 Citations (Scopus)


Let G be a simple graph of order n with m edges. The Laplacian Estrada index of G is defined as LEE = LEE(G) = nΣ i=1 e (μi-2m/n), where μ 1, μ 2, . . . , μ n are the Laplacian eigenvalues of G. In this note, we present two sharp lower bounds for LEE and characterize the graphs for which the bounds are attained.

Original languageEnglish
Pages (from-to)777-784
Number of pages8
JournalMATCH Communications in Mathematical and in Computer Chemistry
Issue number3
Publication statusPublished - 2011

Scopus Subject Areas

  • Chemistry(all)
  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'Note on the laplacian estrada index of a graph'. Together they form a unique fingerprint.

Cite this