Let G = (V, E) be a simple connected and undirected graph. A set F of edges in G is called an edge dominating set if every edge e in E ? F is adjacent to at least one edge in F. The edge domination number ?? (G) of G is ...