Minimum covering color Laplacian energy of a graph

In this paper, we introduced the concept of minimum covering color Laplacian energy LEχC(G) of a graph G and computed minimum covering chromatic Laplacian energies of star graph, complete graph, crown graph, bipartite graph and cocktail graphs. Upper and lower bounds for LEcC(G) are also established.