On Estrada index of trees

Zhou, Bo; Li, Jianping

doi:10.1016/j.laa.2010.08.025

Cited by 42 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Theories of Estrada and Laplacian Estrada indices of graphs have been extensively studied by several authors (see [2,[4][5][6][7][9][10][11][12][13][14][15][16][19][20][21][22][23][24][25][26]).…”

Section: Introductionmentioning

confidence: 99%

On maximum signless Laplacian Estrada index of graphs with given parameters II

Nasiri

Ellahi

Fath-Tabar

et al. 2018

EJGTA

View full text Add to dashboard Cite

Recently Ayyaswamy [1] have introduced a novel concept of the signless Laplacian Estrada index (after here SLEE) associated with a graph G. After works, we have identified the unique graph with maximum SLEE with a given parameter such as: number of cut edges, pendent vertices, (vertex) connectivity and edge connectivity. In this paper we continue our charachterization for two further parameters; diameter and number of cut vertices.

show abstract

Section: Introductionmentioning

confidence: 99%

On maximum signless Laplacian Estrada index of graphs with given parameters II

Nasiri

Ellahi

Fath-Tabar

et al. 2018

EJGTA

View full text Add to dashboard Cite

show abstract

“…e λ i the concept of Estrada index has found successful applications in biochemistry and in complex network [13,14,15,16,17,18,19]. Furthermore, it has been immensely studied in mathematics: In some papers, estimaiting and finding good lower and uper bounds of Estrada index in terms of some parameters of graphs have been discussed [8,23,24,28], and in some other papers, the unique graphs having extremum Estrada index in several subcategories of graphs has been investigated [7,9,12,33,32].…”

Section: Introductionmentioning

confidence: 99%

On maximum signless Laplacian Estrada index of graphs with given parameters

et al. 2016

View full text Add to dashboard Cite

For a simple graph G on n vertices, the signless Laplacian Estrada index is defined as SLEE(G) = n i=1 e q i , where q 1 , q 2 , . . . , q n are the eigenvalues of the signless Laplacian matrix of G. In this paper, the unique graph on n vertices with maximum signless Laplacian Estrada index is determined among graphs with given number of cut edges, pendent vertices, (vertex) connectivity and edge connectivity, respectively.

show abstract

“…Ilić and Stevanović [16] obtained the unique tree with minimum Estrada index among the set of trees with a given maximum degree. Zhang, Zhou and Li [20] determined the unique tree with maximum Estrada indices among the set of trees with a given matching number. In [4], Du and Zhou characterized the unique unicyclic graph with maximum Estrada index.…”

Section: Introductionmentioning

confidence: 99%