Abstract
For a simple graph G on n vertices, the signless Laplacian Estrada index is defined as S L E E ( G ) = ∑ i = 1 n e q i , where q 1 , q 2 , …, q n are the eigenvalues of the signless Laplacian matrix of G . In this paper, the unique graph on n vertices with maximum signless Laplacian Estrada index is determined among graphs with given number of cut edges, pendent vertices, (vertex) connectivity and edge connectivity, respectively.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.