Open AccessMore on Laplacian Estrada indices of trees
Author(s) -
Zhibin Du
Publication year - 2012
Publication title -
filomat
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 34
eISSN - 2406-0933
pISSN - 0354-5180
DOI - 10.2298/fil1201197d
Subject(s) - mathematics , laplace operator , combinatorics , eigenvalues and eigenvectors , laplacian matrix , graph , index (typography) , mathematical analysis , physics , quantum mechanics , world wide web , computer science
The Laplacian Estrada index of a graph G is dened as LEE(G) = P n i=1 e i, where 1; 2;:::; n are the Laplacian eigenvalues of G. We determine the unique tree with maximum Laplacian Estrada index among the set of trees with given bipartition. We also determine the unique trees with the third, the fourth, the fth and the sixth maximum Laplacian Estrada indices.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom