Domination related parameters in the generalized lexicographic product of graphs

Abstract In this paper we begin an exploration of several domination-related parameters (among which are the total, restrained, total restrained, paired, outer connected and total outer connected domination numbers) in the generalized lexicographic product (GLP for short) of graphs. We prove that for each GLP of graphs there exist several equality chains containing these parameters. Some known results on standard lexicographic product of two graphs are generalized or/and extended. We also obtain results on well μ -dominated GLP of graphs, where μ stands for any of the above mentioned domination parameters. In particular, we present a characterization of well μ -dominated GLP of graphs in the cases when μ is the domination number or the total domination number.