Bounds for the augmented Zagreb and the atom-bond connectivity indices

José Luis Palacios

Applied Mathematics and Computation, 2017, vol. 307, issue C, 141-145

Abstract: Using electrical networks and majorization we obtain a lower bound for the augmented Zagreb index in terms of the number of vertices and edges, and the maximum vertex degree. An analogous upper bound for the atom-bond connectivity index is also obtained. These bounds, which are attained by the complete graph Kn, are not comparable to the ones found in the literature.

Keywords: Atom-bond connectivity index; Augmented Zagreb index; Majorization; Foster’s theorem (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317301807
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:307:y:2017:i:c:p:141-145

DOI: 10.1016/j.amc.2017.03.009

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