(n, m)-Graphs with Maximum Zeroth-Order General Randic Index for α ∈ (−1, 0) ∗

Given a graph G =( V, E) and an arbitrary real number α, the zeroth-order general Randic index of the graph G is defined as 0Rα(G )= � u∈V (G) d(u) α , where the summation goes over all vertices of G and d(u) denotes the degree of u in G. In this paper, we characterize the simple connected (n, m)-graphs with the maximum zeroth-order general Randic index for α ∈ (−1, 0), which was left unsolved in our early paper published in Discrete Appl. Math.