For a graph G, the Randić index R(G) of G is defined by R(G)=∑u,v1d(u)d(v), where d(u) is the degree of a vertex u and the summation runs over all edges uv of G. Let G(k,n) be the set of connected simple graphs of order n with minimum degree k. Bollobás and Erdős once asked for finding the minimum value of the Randić index among the graphs in G(k,n). There have been many partial solutions for this...
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.