The signless Laplacian Estrada index of tricyclic graphs
Australasian Journal of Combinatorics Volume 69(1) (2017), Pages 259-270 The signless Laplacian Estrada index of a graph $G$ is defined as $SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we show that there are...
Gespeichert in:
Hauptverfasser: | , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Australasian Journal of Combinatorics Volume 69(1) (2017), Pages
259-270 The signless Laplacian Estrada index of a graph $G$ is defined as
$SLEE(G)=\sum^{n}_{i=1}e^{q_i}$ where $q_1, q_2, \ldots, q_n$ are the
eigenvalues of the signless Laplacian matrix of $G$. In this paper, we show
that there are exactly two tricyclic graphs with the maximal signless Laplacian
Estrada index. |
---|---|
DOI: | 10.48550/arxiv.1412.2280 |