edge domination number

edge domination number

[¦ej ‚däm·ə′nā·shən ‚nəm·bər]
(mathematics)
For a graph, the smallest possible number of edges in a dominating edge set.