More on "Connected (n, m)-graphs with minimum and maximum zeroth-order general Randic index"

Let G be a graph and d(u) denote the degree of a vertex u in G. The zeroth-order general Randic index ^0R"@a(G) of the graph G is defined as @?"u"@?"V"("G")d(u)^@a, where the summation goes over all vertices of G and @a is an arbitrary real number. In this paper we correct the proof of the main Theorem 3.5 of the paper by Hu et al. [Y. Hu, X. Li, Y. Shi, T. Xu, Connected (n,m)-graphs with minimum and maximum zeroth-order general Randic index, Discrete Appl. Math. 155 (8) (2007) 1044-1054] and give a more general Theorem. We finally characterize for @a<0 the connected G(n,m)-graphs with maximum value ^0R"@a(G(n,m)), where G(n,m) is a simple connected graph with n vertices and m edges.