On Laplacian energy in terms of graph invariants

Kinkar Ch. Das, Seyed Ahmad Mojallal and Ivan Gutman

Applied Mathematics and Computation, 2015, vol. 268, issue C, 83-92

Abstract: For G being a graph with n vertices and m edges, and with Laplacian eigenvalues μ1≥μ2≥⋯≥μn−1≥μn=0, the Laplacian energy is defined as LE=∑i=1n|μi−2m/n|. Let σ be the largest positive integer such that μσ ≥ 2m/n. We characterize the graphs satisfying σ=n−1. Using this, we obtain lower bounds for LE in terms of n, m, and the first Zagreb index. In addition, we present some upper bounds for LE in terms of graph invariants such as n, m, maximum degree, vertex cover number, and spanning tree packing number.

Keywords: Laplacian eigenvalues; Laplacian energy; Vertex connectivity; Edge connectivity; Vertex cover number; Spanning tree packing number (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315008450
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:268:y:2015:i:c:p:83-92

DOI: 10.1016/j.amc.2015.06.064

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 ().