Edges contained in all or in no minimum edge dominating set of a tree

摘要

In a graph, an edge dominates itself and all its adjacent edges. An edge dominating set (EDS) in a graph G is a subset of edges that dominates every edge of G. In this paper, we characterize edges that are in all or in no minimum EDS in trees.