A (n, n+2)-graph G is a connected simple graph with n vertices and n + 2 edges. If dv denotes the degree of the vertex v, then the zeroth-order general Randic index of the graph G is defined as R(G, a))=Sum(d(v),a), where α is a real number. We characterize, for any α, the (n, n+2)-graphs with the extremum (minimum for 0 < α < 1 and maximum for α < 0 or α > 1) zeroth-order general Randic index of (n, n + 2)-graphs.
