%0 Journal Article
%T Minimum Covering Randić Energy of a Graph
%A M. R. Rajesh Kanna
%A R. Jagadeesh
%J Advances in Linear Algebra & Matrix Theory
%P 116-131
%@ 2165-3348
%D 2016
%I Scientific Research Publishing
%R 10.4236/alamt.2016.64012
%X Randi&amp;cacute; energy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randi&amp;cacute; energy <em>RE<sub>C</sub></em> (<em>G</em>) of a graph <em>G</em> in this paper. This paper contains computation of minimum covering Randi&amp;cacute; 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 Randi&amp;cacute; energy are also presented.
%K Minimum Covering Set
%K Minimum Covering Randi&amp
%K cacute
%K Matrix
%K Minimum Covering Randi&amp
%K cacute
%K Eigenvalues
%K Minimum Covering Randi&amp
%K cacute
%K Energy
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=72517