On Maximum Signless Laplacian Estrada Index of Graphs with Given Parameters II

Ramin Nasiri • Hamid Reza Ellahi • Gholam Hossein Fath-Tabar • Ahmad Gholami

Download full text
(English, 11 pages)

Abstract

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. 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.

Metrics

  • 95 views
  • 40 downloads

Journal

Electronic Journal of Graph Theory and Applications

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to ... see more