Abstract
Randic energy was first defined in the article [6]. Using minimum covering set, we have introduced in this article Laplacian minimum covering Randic energy \(LRE_C(G)\) of a graph \(G\). This article contains computation of Laplacian minimum covering Randic energies for some standard graphs like star graph, complete graph, crown graph, complete bipartite graph and cocktail graph. At the end of this article upper and lower bounds for Laplacian minimum covering Randic energy are also presented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
