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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
