Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (G) of a graph G in this paper. This p...Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (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.展开更多
文摘Randićenergy was first defined in the paper [1]. Using minimum covering set, we have introduced the minimum covering Randićenergy RE<sub>C</sub> (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.