Note on the laplacian estrada index of a graph

Jianxi Li; Wai Chee SHIU; Wai Hong Chan

Note on the laplacian estrada index of a graph

Jianxi Li^*, Wai Chee SHIU, Wai Hong Chan

^*Corresponding author for this work

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

Let G be a simple graph of order n with m edges. The Laplacian Estrada index of G is defined as LEE = LEE(G) = ⁿΣ _i=1 e ^(μi-2m/n), where μ ₁, μ ₂, . . . , μ _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 language	English
Pages (from-to)	777-784
Number of pages	8
Journal	MATCH Communications in Mathematical and in Computer Chemistry
Volume	66
Issue number	3
Publication status	Published - 2011

Scopus Subject Areas

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

Cite this

@article{b1b22c503cf9492094f2654a5d74a3c1,

title = "Note on the laplacian estrada index of a graph",

abstract = "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.",

author = "Jianxi Li and SHIU, {Wai Chee} and Chan, {Wai Hong}",

year = "2011",

language = "English",

volume = "66",

pages = "777--784",

journal = "MATCH Communications in Mathematical and in Computer Chemistry",

issn = "0340-6253",

publisher = "University of Kragujevac, Faculty of Science",

number = "3",

}

TY - JOUR

T1 - Note on the laplacian estrada index of a graph

AU - Li, Jianxi

AU - SHIU, Wai Chee

AU - Chan, Wai Hong

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - https://match.pmf.kg.ac.rs/content66n3.htm

UR - http://www.scopus.com/inward/record.url?scp=79958824753&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:79958824753

SN - 0340-6253

VL - 66

SP - 777

EP - 784

JO - MATCH Communications in Mathematical and in Computer Chemistry

JF - MATCH Communications in Mathematical and in Computer Chemistry

IS - 3

ER -

Note on the laplacian estrada index of a graph

Abstract

Scopus Subject Areas

Other files and links

Fingerprint

Cite this