ON ENERGY AND LAPLACIAN ENERGY OF GRAPHS

Let G = (V, E) be a simple graph of order n with m edges. The energy of a graph G, denoted by E(G), is defined as the sum of the absolute values of all eigenvalues of G. The Laplacian energy of the graph G is defined as LE = LE(G) = Sigma(n)(i=1) vertical bar mu(i) - 2m/n vertical bar, where mu(1), mu(2), ..., mu(n-1), mu(n) = 0 are the Laplacian eigenvalues of graph G. In this paper, some lower and upper bounds for epsilon(G) are presented in terms of number of vertices, number of edges, maximum degree and the first Zagreb index, etc. Moreover, a relation between energy and Laplacian energy of graphs is given.