P. Francis

Double Total Domination Number of Some Families of Graphs

Let $G$ be a graph of minimum degree at least two. A set $D \subseteq V(G)$ is said to be a \emph{double total dominating set} of $G$, for every vertex $v\in V (G) $ contains at least two neighbors in $D$. The minimum cardinality among all double total dominating sets of $G$ is the \emph{double total domination number}...