%0 Journal Article
%T Neighborhood connected edge domination in graphs
%A Kulandaivel M.P.
%A C. Sivagnanam
%A P. Selvaraju
%J Tamkang Journal of Mathematics
%D 2012
%I Tamkang University
%R 10.5556/j.tkjm.43.2012.69-80
%X 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 < N(X) > 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.
%K Neighborhood Connected Domination
%K Neighborhood Connected Edge Domination
%U http://journals.math.tku.edu.tw/index.php/TKJM/article/view/710