Affiliation:
1. Faculty of Science, University of Kragujevac
2. Faculty of Electronic Engineering, University of Nis
Abstract
Let G = (V,E), V = {1, 2,…,n}, be a simple connected graph with n vertices and m edges and let d1 ≥ d2 ≥⋅ ⋅⋅≥ dn > 0, be the sequence of its vertex degrees. With i ∼ j we denote the adjacency of the vertices i and j in G. The inverse sum indeg index is defined as ISI = ∑ -didj-
di+dj with summation going over all pairs of adjacent vertices. We consider lower bounds for ISI. We first analyze some lower bounds reported in the literature. Then we determine some new lower bounds.
Publisher
University Library in Kragujevac
Reference32 articles.
1. B. Bollobás and P. Erdo , Graphs of extremal weights, Ars Combin. 50 (1998), 225–233.
2. J. Devillers and A. T. Balaban (Eds.), Topological Indices and Related Descriptors in QSAR and QSPR, Gordon & Breach, New York, 1999.
3. M. Eliasi, A. Iranmanesh and I. Gutman, Multiplicative versions of first Zagreb index, MATCH Commun. Math. Comput. Chem. 68 (2012), 217–230.
4. S. Fajtlowicz, On conjectures on Graffiti-II, Congr. Numer. 60 (1987), 187–197.
5. F. Falahati–Nezhad, M. Azari and T. Došlić, Sharp bounds on the inverse sum indeg index, Discrete Appl. Math. 217 (2017), 185–195.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献