pith. sign in

arxiv: 1410.0229 · v1 · pith:I6275C6Hnew · submitted 2014-10-01 · 🧮 math.CO

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

classification 🧮 math.CO
keywords connectivityestradagivengraphindexlaplacianmaximumnumber
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.