Bounds on the Minimum Edge Dominating Energy in Terms of Some Parameters of a Graph

The minimum edge dominating energy, denoted by EEF (G), is the sum of the absolute values of eigenvalues of the minimum edge dominating matrix of graph G. In this paper, we give some bounds and sharp bounds of EEF (G) in terms of matching number, the number of positive eigenvalues of the minimum edge dominating matrix, and the rank of G.