Edges contained in all or in no minimum edge dominating set of a tree
Nacéra Meddah, Mustapha Chellali · Discrete Mathematics Algorithms and Applications · 2019
In a graph, an edge dominates itself and all its adjacent edges. An edge dominating set (EDS) in a graph [Formula: see text] is a subset of edges that dominates every edge of [Formula: see text] In this paper, we characterize edges that are in all or in no minimum EDS in trees.