Randic energy of specific graphs

Let G be a simple graph with vertex set V (G) = {v(1), v(2,) ... , v(n)}. The Randic matrix of G, denoted by R(G), is defined as the n x n matrix whose (i, j)-entry is (d(i)d(j))(-1/2) if v(i) and v(j) are adjacent and 0 for another cases. Let the eigenvalues of the Randic matrix R(G) be rho(1) >= rho(2) >= ... >= rho(n) which are the roots of the Randic characteristic polynomial Pi(n)(i=1) (rho rho(i)). The Randic energy RE of G is the sum of absolute values of the eigenvalues of R(G). In this paper, we compute the Randic characteristic polynomial and the RandiC energy for specific graphs. (C) 2015 Elsevier Inc. All rights reserved.