Author(s)

M. R. Rajesh Kanna^1,2*, R. Jagadeesh³

¹Department of Mathematics, Government First Grade College, Puttur, India.
²Department of Mathematics, Maharani’s Science College for Women, Mysore, India.
³Research and Development Centre, Bharathiar University, Coimbatore, India.

Randić energy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randić energy RE_C (G) of a graph G in this paper. This paper contains computation of minimum covering Randić 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ć energy are also presented.

Minimum Covering Set, Minimum Covering Randić Matrix, Minimum Covering Randić Eigenvalues, Minimum Covering Randić Energy

Kanna, M. and Jagadeesh, R. (2016) Minimum Covering Randić Energy of a Graph. Advances in Linear Algebra & Matrix Theory, 6, 116-131. doi: 10.4236/alamt.2016.64012.