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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
