e/Edge dominating set

Information
has gloss	eng: In graph theory, an edge dominating set for a graph G = (V, E) 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 (a)–(d) are examples of edge dominating sets (thick red lines).
lexicalization	eng: edge dominating set
instance of	c/Computational problems in graph theory

Media
media:img	Edge-dominating-set.svg