On maximum signless Laplacian Estrada index of graphs with given parameters II
Main Authors: | Nasiri, Ramin; Department of Mathematics, Faculty of Science, University of Qom, Qom 37161-46611, I. R. Iran, Ellahi, Hamid Reza; Department of Mathematics, Faculty of Science, University of Qom, Qom 37161-46611, I. R. Iran, Fath-Tabar, Gholam Hossein; Department of Mathematics, Statistics and Computer Science, Faculty of Science, University of Kashan, Kashan 87317-51167, I. R. Iran., Gholami, Ahmad; Department of Mathematics, Faculty of Science, University of Qom, Qom 37161-46611, I. R. Iran |
---|---|
Format: | Article info application/pdf eJournal |
Bahasa: | eng |
Terbitan: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB
, 2018
|
Subjects: | |
Online Access: |
https://www.ejgta.org/index.php/ejgta/article/view/261 https://www.ejgta.org/index.php/ejgta/article/view/261/pdf_74 https://www.ejgta.org/index.php/ejgta/article/downloadSuppFile/261/33 |
Daftar Isi:
- The signless Laplacian Estrada index of a graph G is defined as SLEE(G) = ∑ni = 1eqi where q1, q2, ..., qn are the eigenvalues of the signless Laplacian matrix of G. Following the previous work in which we have identified the unique graphs with maximum signless Laplacian Estrada index with each of the given parameters, namely, number of cut edges, pendent vertices, (vertex) connectivity, and edge connectivity, in this paper we continue our characterization for two further parameters: diameter and number of cut vertices.