A linear-programming approach to the generalized Randić index Original Research Article

The generalized Randić index Rα(G) of a graph G is the sum of (dG(u)dG(v))α over all edges uv of G. Using a linear-programming approach, we establish results on graphs with a given number of vertices and edges and a bounded maximum degree that are of minimum generalized Randić index for α∈{−12,−1}.