Some Statistical Results on Randic Energy of Graphs

Let (G) over cap (n,m) be the set of all simple graphs with n vertices and m edges. In this paper, we establish the average value of the difference between Randic energy of two graphs selected randomly from the set (G) over cap (n,m). By means of this result, we get a criteria for deciding when two graphs are almost Randic equienergetic.