In this paper, we have introduced minimum covering maximum reverse degree energy of simple graphs. Few properties on minimum covering maximum reverse degree eigenvalues and bounds for minimum covering maximum reverse degree energy of a graph are achieved. Further minimum covering maximum reverse degree energy of some families of graphs are computed.