Domination in lexicographic product graphs. (Q2918549)

Let \(G_1\) and \(G_2\) be graphs of order at least \(2\) and without isolated vertices. In this work the following results are obtained: NEWLINE{\parindent=7mmNEWLINE\begin{itemize}\item[(a)]\(\gamma _t (G_1[G_2]) = \gamma _t (G_1)\), NEWLINE\item[(b)]\(\gamma _r (G_1[G_2]) = \gamma (G_1[G_2])\), NEWLINE\item[(c)]\(\gamma _{tr} (G_1[G_2]) \leq \gamma _{tr} (G_1)\), and NEWLINE\item[(d)]if \(\gamma _{c} (G_1) \geq 2\) then \(\gamma _{c} (G_1[G_2]) = \gamma _{c} (G_1)\), NEWLINENEWLINE\end{itemize}}NEWLINEwhere \(G_1[G_2]\) is the lexicographic product of \(G_1\) and \(G_2\), and \(\gamma , \gamma _{t}, \gamma _{r}, \gamma _{tr}, \gamma _{c}\) are the domination number, total domination number, restrained domination number, total restrained domination number and connected domination number, respectively.