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

2014/10/01 by Ramin Nasiri, Nasiri, Ramin, Hamid Reza Ellahi +5
Mathematics · #05C12 #05C35 #05C50 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C12 #msc:05C35 #msc:05C50

paper · pdf · doi:10.48550/arxiv.1410.0229

12 pages, 4 figures

arxiv created 2014/10/01 · arxiv updated 2014/10/02

Abstract

Recently Ayyaswamy [1] have introduced a novel concept of the signless Laplacian Estrada index (after here SLEE) associated with a graph G. After works, we have identified the unique graph with maximum SLEE 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.

Related

• New lower bounds for the Estrada and Signless Laplacian Estrada Index of\n a Graph
• On maximum Estrada indices of bipartite graphs with some given parameters
• More on the normalized Laplacian Estrada index
• Some New Lower Bounds for the Estrada Index
• Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs