From \(w\)-domination in graphs to domination parameters in lexicographic product graphs (Q6102213)

Study about the concept of domination parameters of graphs is quite frequent and popular. A large number of papers have already appeared on this topic. The authors look at one such method of unifying various parameters in one definition and compute the same for some specific families of product graphs. They concentrate on the computation of parameters such as quasi-total Italian domination, total Italian domination, 2-domination, double domination, total \(\{2\}\)-domination, and double total domination of lexicographic product graphs.