On the Minimum First-Inverse Nirmala Index of Trees
Let G be a graph with edge set E(G). The degree of a vertex w in G is denoted by d(w). The first-inverse Nirmala (FIN) index and the atom-bond connectivity (ABC) index of the graph G are defined, respectively, as FIN(G)=∑uv∈E(G)(d(u))−1+(d(v))−1 and ABC(G)=∑uv∈E(G)(d(u))−1+(d(v))−1−2(d(u)d(v))−1. The problem of determi...