Edge dominating set

Edge dominating set --- рёберное доминирующее множество.

A set [math]\displaystyle{ F }[/math] of edges in a graph [math]\displaystyle{ G }[/math] is an edge dominating set if every edge in [math]\displaystyle{ E - F }[/math] is adjacent to at least one edge in [math]\displaystyle{ F }[/math]. The edge domination number [math]\displaystyle{ \gamma^{1}(G) }[/math] is the minimum cardinality of the edge dominating set of [math]\displaystyle{ G }[/math].