The Laplacian-energy-like graph invariant of a graph , denoted by , is defined as , where are the Laplacian eigenvalues of graph . In this paper, we study the maximum among graphs with a given number of vertices and matching number. Some results on and are obtained.