@Article{CMR-32-4,
author = {Ma, Hongxia and Liu, Juan},
title = {The Twin Domination Number of Strong Product of Digraphs},
journal = {Communications in Mathematical Research },
year = {2016},
volume = {32},
number = {4},
pages = {332--338},
abstract = {<p style="text-align: justify;">Let $γ^∗
(D)$ denote the twin domination number of digraph $D$ and let $D_1 ⊗ D_2$ denote the strong product of $D_1$ and $D_2$. In this paper, we obtain that the
twin domination number of strong product of two directed cycles of length at least $2$.
Furthermore, we give a lower bound of the twin domination number of strong product
of two digraphs, and prove that the twin domination number of strong product of the
complete digraph and any digraph $D$ equals the twin domination number of $D$.</p>},
issn = {2707-8523},
doi = {https://doi.org/10.13447/j.1674-5647.2016.04.05},
url = {https://global-sci.com/article/81688/the-twin-domination-number-of-strong-product-of-digraphs}
}