ON MINIMUM COVERING PARTITION ENERGY OF A GRAPH
The partition energy of a graph was introduced by Sampathkumar et al. [14]. Motivated by this, we introduce the concept of minimum covering partition energy of a graph and compute the same for few families of graphs. We establish the bounds for minimum covering partition energy.
minimum covering set, minimum covering k-partition eigenvalues, minimum covering k-partition energy, k-complement, -complement.
