The Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph G, the signless Laplacian Estrada index is defined as SLEE(G)=∑ni=1eqi, where q1, q2,..., qn are the eigenvalues of the signless Laplacian matrix of G. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest SLEE's and t...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Kashan
2017-12-01
|
| Series: | Mathematics Interdisciplinary Research |
| Subjects: | |
| Online Access: | https://mir.kashanu.ac.ir/article_46679_9ebe519f917a721f6f9fd832c72a83d7.pdf |
| Summary: | For a simple graph G, the signless Laplacian Estrada index is defined as SLEE(G)=∑ni=1eqi, where q1, q2,..., qn are the eigenvalues of the signless Laplacian matrix of G. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest SLEE's and then determine the unique unicyclic graph with maximum SLEE among all unicyclic graphs on n vertices with a given diameter. All extremal graphs, which have been introduced in our results are also extremal with respect to the signless Laplacian resolvent energy. |
|---|---|
| ISSN: | 2476-4965 |