Neighborhood connected edge domination in graphs
Kulandaivel Maruthamuthu Paramasivam, C. Sivagnanam, Periyasami Selvaraju · Tamkang Journal of Mathematics · 2012
Let G = (V,E) be a connected graph. An edge dominating set X of G is called a neighborhood connected edge dominating set (nced-set) if the edge induced subgraph is connected. The minimum cardinality of a nced-set of G is called the neighborhood connected edge domination number of G and is denoted by. In this paper we initiate a study of this parameter.