论文信息 - On the total domination number of cross products of graphs

On the total domination number of cross products of graphs

We give lower and upper bounds on the total domination number of the cross product of two graphs, @c"t(GxH). These bounds are in terms of the total domination number and the maximum degree of the factors and are best possible. We further investigate cross products involving paths and cycles. We determine the exact values of @c"t(GxPn) and @c"t(C"nxC"m) where P"n and C"n denote, respectively, a path and a cycle of length n.

Sylvain Gravier | Mohamed El-Zahar | Antoaneta Klobucar

[1] Sylvain Gravier,et al. Domination Number of the Cross Product of Paths , 1999, Discret. Appl. Math..

[2] Sylvain Gravier,et al. Total domination number of grid graphs , 2002, Discret. Appl. Math..

[3] Norbert Seifter,et al. K-Dominating Sets of Cardinal Products of Paths , 2000, Ars Comb..

[4] Gregory Gutin,et al. Orientations of digraphs almost preserving diameter , 2002, Discret. Appl. Math..

[5] Vojtěch Rödl,et al. Products of graphs and their applications , 1983 .

[6] Antoaneta Klobučar. K-dominating sets of $P_(2k+2)\times P_n$ and $P_m\times P_n$ , 2001 .