Abstract
The signless Laplacian Estrada index of a graph is defined as SLEE(G)=∑i=1neqi, where q1,q2,…,qn are the eigenvalues of the signless Laplacian matrix of G. In this paper, we determine the unique bicyclic graph with maximum SLEE and the unique bipartite bicyclic graph with maximum SLEE, respectively.
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
