Basavanagoud, B., Hosamani, S. (2012). Connected cototal domination number of a graph. Transactions on Combinatorics, 1(2), 17-26. doi: 10.22108/toc.2012.820

B. Basavanagoud; Sunilkumar M Hosamani. "Connected cototal domination number of a graph". Transactions on Combinatorics, 1, 2, 2012, 17-26. doi: 10.22108/toc.2012.820

Basavanagoud, B., Hosamani, S. (2012). 'Connected cototal domination number of a graph', Transactions on Combinatorics, 1(2), pp. 17-26. doi: 10.22108/toc.2012.820

Basavanagoud, B., Hosamani, S. Connected cototal domination number of a graph. Transactions on Combinatorics, 2012; 1(2): 17-26. doi: 10.22108/toc.2012.820

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.