Abstract: Let be a simple graph. For an edge e
of G, the closed edge-neighborhood of e is the set is adjacent toA function is called a minus edge domination
function (MEDF) of G if for every edge e
of G. The minus edge domination number
of G is defined as In this paper, it is proved that for any graph G,
where is the number of edges in a minimum
maximal matching of a graph G. These
bounds are best possible and extremal graphs are characterized for trees.
Keywords and phrases: graph, minus edge domination function, minus edge domination number.
