Article ID Journal Published Year Pages File Type
6871677 Discrete Applied Mathematics 2018 6 Pages PDF
Abstract
The signless Laplacian Estrada index of a graph is defined as SLEE(G)=∑i=1neqi, where q1,q2,…,qn are the eigenvalues of the signless Laplacian matrix of G. In this paper, we determine the unique bicyclic graph with maximum SLEE and the unique bipartite bicyclic graph with maximum SLEE, respectively.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
On the signless Laplacian Estrada index of bicyclic graphs
Authors
, , ,