On the existence of independent \((1,k)\)-dominating sets for \(k\in\{1,2\}\) in two products of graphs (Q7230464)

Let \(G\) be a graph. A set \(D\subseteq V(G)\) is an independent set of \(G\) if there are no edges between vertices of \(D\). An independent set \(D\) is an independent \((1,1)\)-dominating set if there exist two different vertices of \(D\) adjacent to every vertex of \(V(G)-D\). Similar is an independent set \(D\), an independent \((1,2)\)-dominating set if every vertex from \(V(G)-D\) is adjacent to one member of \(D\) and is at distance at most two to another vertex from \(D\).\N\NDirect \(G\times H\) and strong product \(G\boxtimes H\) of graphs \(G\) and \(H\) are graph with the same vertex set \(V(G)\times V(H)\). Two vertices \((g,h)\) and \((g',h')\) are adjacent in \(G\times H\) if \(gg'\in E(G)\) and \(hh'\in E(H)\). The strong product contains all edges of a direct product and additionally also edges that project to an edge in one factor and to a vertex in the other factor.\N\NIn the present work, the authors characterize when there exists an independent \((1,1)\)- and an independent \((1,2)\)-dominating sets in direct and strong product of graphs. The conditions do not only depend on the existence of an independent \((1,1)\)- or an independent \((1,2)\)-dominating sets in factors.