Minimum Covering Randicacute; Energy of a Graph

摘要

Randicacute; energy was first defined in the paper 1. Using minimum covering set, we have introduced the minimum covering Randicacute; energy REC (G) of a graph G in this paper. This paper contains computation of minimum covering Randicacute; energies for some standard graphs like star graph, complete graph, thorn graph of complete graph, crown graph, complete bipartite graph, cocktail graph and friendship graphs. At the end of this paper, upper and lower bounds for minimum covering Randicacute; energy are also presented.