Extremal Laplacian energy of threshold graphs

Kinkar Ch. Das and Seyed Ahmad Mojallal

Applied Mathematics and Computation, 2016, vol. 273, issue C, 267-280

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.

Keywords: Laplacian eigenvalues; Laplacian energy; Threshold graphs (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031501334X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:273:y:2016:i:c:p:267-280

DOI: 10.1016/j.amc.2015.10.002

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().