Extremal Laplacian energy of threshold graphs

摘要

Let G be a connected threshold graph of order n with m edges and trace T. In this paper we give a lower bound on Laplacian energy in terms of n, m and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. Moreover, we obtain the threshold graphs with the largest and the second largest Laplacian energies.