جستجوی مقالات مرتبط با کلیدواژه « higher Randić index » در نشریات گروه « شیمی »

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