University of IsfahanTransactions on Combinatorics2251-86571220120601Connected cototal domination number of a graph172682010.22108/toc.2012.820ENB.BasavanagoudKarnatak Universityhttps://orcid.org/00Sunilkumar MHosamaniKarnatak University, DharwadJournal Article20120326A 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.https://toc.ui.ac.ir/article_820_bd185d6e0dce9d0bea5fb29b49ff1348.pdf