Das, Kinkar Ch.Gutman, IvanCevik, A. SinanZhou, Bo2020-03-262020-03-2620130340-6253https://hdl.handle.net/20.500.12395/29694Let G be a connected graph of order n with Laplacian eigenvalues mu(1) >= mu(2) >= ... >= mu(n-1) > mu(n) = 0. The Laplacian energy of the graph G is defined as LE = LE(G) = (n)Sigma(i=1)vertical bar mu(i)-2m/n vertical bar. Upper bounds for LE are obtained, in terms of n and the number of edges m.eninfo:eu-repo/semantics/closedAccessArticle702689696WOS:000328007000022Q1