For a simple graph ?$G$? on n vertices, the signless Laplacian Estrada index is defined as ?$SLEE(G) = \sum_{i=1}^n e^{q_i}$ where $q_1, q_2, \dots , q_n$? are the eigenvalues of the signless Laplacian matrix of ?$G$?. In this paper, the unique graph on ?$n$? vertices with maximum signless Laplacian Estrada index is determined among graphs with given number of cut edges, pendent vertices, (vertex) connectivity and edge connectivity, respectively.

Rights

URN

URN:NBN:SI:DOC-UGEBRPWQ

COBISSID

17859417

Added

29.05.2020

Metadata

Citation

APA:

Ellahi, Hamid Reza, Fath-Tabar, Gholam Hossein, Gholami, Ahmad, Nasiri, Ramin (2016). On maximum signless Laplacian Estrada index of graphs with given parameters. Ars mathematica contemporanea, volume 11, issue 2, str. 381-389. URN:NBN:SI:DOC-UGEBRPWQ from http://www.dlib.si

MLA:

Ellahi, Hamid Reza, Fath-Tabar, Gholam Hossein, Gholami, Ahmad, Nasiri, Ramin. "On maximum signless Laplacian Estrada index of graphs with given parameters." Ars mathematica contemporanea volume 11. issue 2 (2016) str. 381-389.
<http://www.dlib.si/?URN=URN:NBN:SI:DOC-UGEBRPWQ>

Ars mathematica contemporanea
2008-
(Assembly record)