Complementary edge domination in graphs
Kulli, V.R., N. D. Soner · ePrints@Bangalore University (Bangalore University) · 1997
Let F be a minimum edge dominating set of G. If E - F contains an edge dominating set say F′, then F′ is called a complementary edge dominating set of G with respect to F. The complementary edge domination number γ′c(G) of G is the minimum number of edges in a complementary edge dominating set of G. We note that γ′c(G) is defined for graphs G with no isolated edges. In this paper, we obtain some bounds for γ′c(G). Also Nordhaus-Gaddum type results are found.