Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4626032 | Applied Mathematics and Computation | 2016 | 14 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Kinkar Ch. Das, Seyed Ahmad Mojallal,