%0 Journal Article
%T Connected cototal domination number of a graph
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Basavanagoud, B.
%A Hosamani, Sunilkumar M
%D 2012
%\ 06/01/2012
%V 1
%N 2
%P 17-26
%! Connected cototal domination number of a graph
%K Domination Number
%K connected domination number
%K cototal domination number and connected cototal domination number
%R 10.22108/toc.2012.820
%X A dominating set $D \subseteq V$ of a graph $G = (V,E)$ is said to be a connected cototal dominating set if $\langle D \rangle$ is connected and $\langle V-D \rangle \neq \varnothing $, contains no isolated vertices. A connected cototal dominating set is said to be minimal if no proper subset of $D$ is connected cototal dominating set. The connected cototal domination number $\gamma_{ccl}(G)$ of $G$ is the minimum cardinality of a minimal connected cototal dominating set of $G$. In this paper, we begin an investigation of connected cototal domination number and obtain some interesting results.
%U https://toc.ui.ac.ir/article_820_bd185d6e0dce9d0bea5fb29b49ff1348.pdf