Abstract
The Laplacian Estrada index of a graph G is defined as LEE(G)= ?ni=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 fifth and the sixth maximum Laplacian Estrada indices.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
