the Higher Randic Index

Let G be a simple graph with vertex set V(G) = {v(1), v(2),...v(n)} For every vertex v(i), delta(v(i)) represents the degree of vertex v(i) The h-th order of Randic index, R-h is defined as the sum of terms 1/root delta(v(i1)), delta(v(i2))...delta(v(ih+1)) over all paths of length h contained (as sub graphs) in G. In this paper, some bounds for higher Randic index and a method for computing the higher Randic index of a simple graph is presented. Also, the higher Randic index of coronene/circumcoronene is computed.