On maximum signless Laplacian Estrada index of graphs with given parameters

From MaRDI portal
Publication:2958703

DOI10.26493/1855-3974.838.8FDzbMATH Open1355.05154arXiv1410.0229OpenAlexW2901011484WikidataQ129366277 ScholiaQ129366277MaRDI QIDQ2958703FDOQ2958703


Authors: Hamid Reza Ellahi, Ahmad Gholami, G. H. Fath-Tabar, R. Nasiri Edit this on Wikidata


Publication date: 3 February 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1410.0229




Recommendations





Cited In (10)





This page was built for publication: On maximum signless Laplacian Estrada index of graphs with given parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958703)