More on “Connected (n, m)-graphs with minimum and maximum zeroth-order general Randić index” Original Research Article

Let image be a graph and image denote the degree of a vertex image in image. The zeroth-order general Randić index image of the graph image is defined as image, where the summation goes over all vertices of image and image 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 image-graphs with minimum and maximum zeroth-order general Randić index, Discrete Appl. Math. 155 (8) (2007) 1044–1054] and give a more general Theorem. We finally characterize for image the connected image-graphs with maximum value image, where image is a simple connected graph with image vertices and image edges.