@article {
author = {Basavanagoud, B. and Hosamani, Sunilkumar},
title = {Connected cototal domination number of a graph},
journal = {Transactions on Combinatorics},
volume = {1},
number = {2},
pages = {17-26},
year = {2012},
publisher = {University of Isfahan},
issn = {2251-8657},
eissn = {2251-8665},
doi = {10.22108/toc.2012.820},
abstract = {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.},
keywords = {Domination Number,connected domination number,cototal domination number and connected cototal domination number},
url = {https://toc.ui.ac.ir/article_820.html},
eprint = {https://toc.ui.ac.ir/article_820_bd185d6e0dce9d0bea5fb29b49ff1348.pdf}
}