On energy and Laplacian energy of bipartite graphs

Kinkar Ch. Das, Seyed Ahmad Mojallal and Ivan Gutman

Applied Mathematics and Computation, 2016, vol. 273, issue C, 759-766

Abstract: Let G be a bipartite graph of order n with m edges. The energy E(G) of G is the sum of the absolute values of the eigenvalues of the adjacency matrix A. In 1974, one of the present authors established lower and upper bounds for E(G) in terms of n, m, and detA. Now, more than 40 years later, we correct some details of this result and determine the extremal graphs. In addition, an upper bound on the Laplacian energy of bipartite graphs in terms of n, m, and the first Zagreb index is obtained, and the extremal graphs characterized.

Keywords: Bipartite graph; Spectrum (of graph); Energy (of graph); Laplacian energy (search for similar items in EconPapers)
Date: 2016
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/S0096300315013983
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:759-766

DOI: 10.1016/j.amc.2015.10.047

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