On the super domination number of lexicographic product graphs

M. Dettlaff, M. Lemańska, J. A. Rodríguez-Velázquez +1

The neighbourhood of a vertex $v$ of a graph $G$ is the set $N(v)$ of all vertices adjacent to $v$ in $G$. For $D\subseteq V(G)$ we define $\overline{D}=V(G)\setminus D$. A set $D\…