on laplacian resolvent energy of graphs

Abstract. let g be a simple connected graph of order n and size m. the matrix l(g) = d(g)−a(g) is the laplacian matrix of g, where d(g) and a(g) are the degree diagonal matrix and the adjacency matrix, respectively. for the graph g, let d1 ≥ d2 ≥ · · · dn be the vertex degree sequence and µ1 ≥ µ2 ≥ · · · ≥ µn−1 > µn = 0 be the laplacian eigenvalues. the laplacian resolvent energy rl(g) of a graph g is defined as rl(g) ... . in this paper, we obtain an upper bound for i=1the laplacian resolvent energy rl(g) in terms of the order, size and the algebraic connectivity of the graph. further, we establish relations between the laplacian resolvent energy rl(g) with each of the laplacian-energy-like invariant lel, the kirchhoff index kf and the laplacian energy le of the graph.