1 Answers
In graph theory, an edge dominating set for a graph G = is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is also known as a line dominating set. Figures – are examples of edge dominating sets.
A minimum edge dominating set is a smallest edge dominating set. Figures and are examples of minimum edge dominating sets.
4 views
Answered