%0 Journal Article
%T Connected cototal domination number of a graph
%A B Basavanagoud
%A Sunilkumar M Hosamani
%J Transactions on Combinatorics
%D 2012
%I University of Isfahan
%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 phi$, 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.
%K domination number
%K connected domination number
%K cototal domination number and connected cototal domination number
%U http://www.combinatorics.ir/?_action=showPDF&article=820&_ob=bd185d6e0dce9d0bea5fb29b49ff1348&fileName=full_text.pdf