New results on the minimum edge dominating energy of a graph

Abstract

Let G be a graph with n vertices and m edges. The min-imum edge dominating energy is dened as the sum of the absolutevalues of eigenvalues of the minimum edge dominating matrix of thegraph G. In this paper, some lower and upper bounds for the minimumedge dominating energy of the graph G are established.