TY - JOUR
T1 - The Twin Domination Number of Strong Product of Digraphs
AU - Ma , Hongxia
AU - Liu , Juan
JO - Communications in Mathematical Research 
VL - 4
SP - 332
EP - 338
PY - 2021
DA - 2021/05
SN - 32
DO - http://doi.org/10.13447/j.1674-5647.2016.04.05
UR - https://global-sci.org/intro/article_detail/cmr/18905.html
KW - twin domination number, strong product, directed cycle.
AB - <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>