Domination related parameters in the generalized lexicographic product of graphs

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 $\mu$-dominated GLP of graphs, where $\mu$ stands for any of the above mentioned domination parameters. In particular, we present a characterization of well $\mu$-dominated GLP of graphs in the cases when $\mu$ is the domination number or the total domination number.

[1]  M. Plummer.  Some covering concepts in graphs , 1970 .

[2]  Liang Sun,et al.  On total restrained domination in graphs , 2005 .

[3]  Joanna Cyman.  The outer-connected domination number of a graph , 2007, Australas. J Comb..

[4]  Joanna Cyman,et al.  Total outer-connected domination numbers of trees , 2009, Discret. Appl. Math..

[5]  Peter J. Slater,et al.  Paired-domination in graphs , 1998, Networks.

[6]  Douglas F. Rall,et al.  Acyclic domination , 2000, Discret. Math..

[7]  Nathaniel Dean,et al.  Well-covered graphs and extendability , 1994, Discret. Math..

[8]  Juan A. Rodríguez-Velázquez,et al.  Double domination in lexicographic product graphs , 2020, Discret. Appl. Math..

[9]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[10]  Tadeja Kraner Sumenjak,et al.  On the Roman domination in the lexicographic product of graphs , 2012, Discret. Appl. Math..

[11]  J. A. Telle.  Vertex partitioning problems: characterization, complexity and algorithms on partial K-trees , 1994 .

[12]  Xindong Zhang,et al.  Domination in lexicographic product graphs , 2011, Ars Comb..

[13]  Ermelinda DeLaViña,et al.  On Total Domination in Graphs , 2012 .

[14]  Martin Milanic,et al.  Characterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs , 2017, Discret. Math. Theor. Comput. Sci..

[15]  Bert Hartnell,et al.  Well-located graphs: a collection of well-covered ones , 2004, Discret. Math..

[16]  Douglas F. Rall,et al.  Associative graph products and their independence, domination and coloring numbers , 1996, Discuss. Math. Graph Theory.

[17]  Tadeja Kraner Sumenjak,et al.  Rainbow domination in the lexicographic product of graphs , 2012, Discret. Appl. Math..

[18]  Juan A. Rodríguez-Velázquez,et al.  On the super domination number of lexicographic product graphs , 2019, Discret. Appl. Math..