On Maximum Signless Laplacian Estrada Index of Graphs with Given Parameters II
Combinatorics
2014-10-02 v1
Abstract
Recently Ayyaswamy [1] have introduced a novel concept of the signless Laplacian Estrada index (after here ) associated with a graph . After works, we have identified the unique graph with maximum with a given parameter such as: number of cut vertices, (vertex) connectivity and edge connectivity. In this paper we continue out characterization for two further parameters; diameter and number of cut vertices.
Keywords
Cite
@article{arxiv.1410.0229,
title = {On Maximum Signless Laplacian Estrada Index of Graphs with Given Parameters II},
author = {Ramin Nasiri and Hamid Reza Ellahi and Gholam Hossein Fath-Tabar and Ahmad Gholami},
journal= {arXiv preprint arXiv:1410.0229},
year = {2014}
}
Comments
12 pages, 4 figures