From (secure) \(w\)-domination in graphs to protection of lexicographic product graphs (Q2239006)

Let \(w = (w_0,w_1,\ldots ,w_\ell)\) be a vector of nonnegative integers with \(w_0\ge 1\). A function \(f:V(G)\rightarrow \{0,1,\ldots , \ell\}\) is a \(w\)-dominating function of a graph \(G\) if \(f(N(v)) \ge w_i\) holds for for every vertex \(v\) with \(f(v)=i\). The \(w\)-domination number \(\gamma_w(G)\) of \(G\) is the minimum weight among all \(w\)-dominating functions. This concepts widely generalizes many standard domination concepts. For instance, the domination number is \(\gamma_{(1,0)}\), the total domination number is \(\gamma_{(1,1)}\), the Italian domination number is \(\gamma_{(2,0,0)}\), and the total Italian domination number is \(\gamma_{(2,1,1)}\). Similarly one defines the secure \(w\)-domination number \(\gamma_w^s(G)\) of \(G\) such that \(\gamma_{(1,0)}^s\) is the secure domination number. In this paper, results on domination invariants of lexicographic products \(G\circ H\) are expressed with \(w\)-domination invariants of \(G\). For instance, if \(\gamma_{(1,0)}^s(H)\ge 4\) and \(\gamma(H)\ge 3\), then \(\gamma_{(1,0)}^s(G\circ H) = \gamma_{(2,2,2)}(G)\). Exact results for \(\gamma_{(1,0)}^s(G\circ H)\) are then deduced when \(G\) is a complete (bipartite) graph, path, or a cycle. It is further proved that if \(H\) is a noncomplete graph with a dominating vertex, then \(\gamma_{(1,0,0)}^s(G\circ H) = \gamma_{(2,1,0)}(G)\). Similar results are also proved for the secure total domination and total weak Roman domination. For instance, if \(\gamma_{(1,1)}^s(H) = 2\), then \(\gamma_{(1,1)}^s(G\circ H) = \gamma_{(1,1,0)}^s(G)\), and if \(\gamma(H)\ge 3\), then \(\gamma_{(1,1)}^s(G\circ H) = \gamma_{(2,2,2)}(G)\).