%0 Journal Article
%T Neighborhood connected perfect domination in graphs
%A Kulandai Vel M.P.
%A Selvaraju P.
%A Sivagnanam C.
%J Tamkang Journal of Mathematics
%D 2012
%I Tamkang University
%R 10.5556/j.tkjm.43.2012.557-562
%X Let $G = (V, E)$ be a connected graph. A set $S$ of vertices in $G$ is a perfect dominating set if every vertex $v$ in $V-S$ is adjacent to exactly one vertex in $S$. A perfect dominating set $S$ is said to be a neighborhood connected perfect dominating set (ncpd-set) if the induced subgraph $$ is connected. The minimum cardinality of a ncpd-set of $G$ is called the neighborhood connected perfect domination number of $G$ and is denoted by $gamma_{ncp}(G)$. In this paper we initiate a study of this parameter.
%K Neighborhood connected domination
%K Neighborhood connected perfect domination
%U http://journals.math.tku.edu.tw/index.php/TKJM/article/view/839