Abstract
The signless Laplacian Estrada index of a graph G is defined as SLEE(G)=∑i=1neqi, where q1,q2,…,qn are the eigenvalues of the signless Laplacian matrix of G. A cactus is a connected graph in which any two cycles have at most one common vertex. In this paper, we characterize the unique graph with maximum SLEE among all cacti with n vertices and k cycles. Also, the unique graph with maximum SLEE among all cacti with n vertices and k cut edges is determined.
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
