Remark on lower bound for forgotten topological index
Abstract:
Let G be a simple connected graph with n vertices and m edges with vertex degree sequence d1 ≥ d2 ≥ . . . ≥ dn > 0. Denote by F = Σni =1 d3i forgotten topological index of graph G. In this paper we give some lower bounds for invariant F. Also, obtained bounds are compared with some known bounds from the literature.