dominating edge set

dominating edge set

[¦däm·ə‚nād·iŋ ′ej ‚set] (mathematics) A set of edges of a graph such that every edge is either a member of this set or has a vertex in common with a member of this set.