Maximal value of the zeroth-order Randić index Original Research Article

Let G(n,m) be a connected graph without loops and multiple edges which has n vertices and m edges. We find the graphs on which the zeroth-order connectivity index, equal to the sum of degrees of vertices of G(n,m) raised to the power −12, attains maximum.