On the Higher Randic Index

Let g be a simple graph with vertex set v(g) ?{v1,v2 ,...vn} . for every vertex i v , ( ) i ? vrepresents the degree of vertex i v . the h-th order of randi? index, h r is defined as the sumof terms1 2 11( ), ( )... ( ) i i ih ? v ? v ? v?over all paths of length h contained (as sub graphs) in g . inthis paper , some bounds for higher randi? index and a method for computing the higherrandic index of a simple graph is presented . also, the higher randi? index ofcoronene/circumcoronene is computed.