TY - JOUR
ID - 820
TI - Connected cototal domination number of a graph
JO - Transactions on Combinatorics
JA - TOC
LA - en
SN - 2251-8657
AU - Basavanagoud, B.
AU - Hosamani, Sunilkumar M
AD - Karnatak University
AD - Karnatak University, Dharwad
Y1 - 2012
PY - 2012
VL - 1
IS - 2
SP - 17
EP - 26
KW - Domination Number
KW - connected domination number
KW - cototal domination number and connected cototal domination number
DO - 10.22108/toc.2012.820
N2 - 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.
UR - https://toc.ui.ac.ir/article_820.html
L1 - https://toc.ui.ac.ir/article_820_bd185d6e0dce9d0bea5fb29b49ff1348.pdf
ER -