On maximum signless Laplacian Estrada index of graphs with given parameters

چکیده مقاله

For a simple graph G on n vertices, the signless Laplacian Estrada index is defined as SLEE(G) =sum_i=1^ne^q_i , where q_1; q_2; : : : ; q_n are the eigenvalues of the signless Laplacian matrix of G. In this paper, the unique graph on n vertices with maximum signless Lapla-cian Estrada index is determined among graphs with given number of cut edges, pendent vertices, (vertex) connectivity and edge connectivity, respectively.