Article ID Journal Published Year Pages File Type
5775855 Applied Mathematics and Computation 2017 5 Pages PDF
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.
Related Topics
Physical Sciences and Engineering Mathematics Applied Mathematics
Authors
,