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

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…