History


Please fill in your query. A complete syntax description you will find on the General Help page.
Total domination number of grid graphs. (English)
Discrete Appl. Math. 121, No.1-3, 119-128 (2002).
Author’s abstract: We use the link between the existence of tilings in Manhattan metric with $\{1\}$-bowls and minimum total dominating sets of Cartesian products of paths and cycles. From the existence of such a tiling, we deduce the asymptotical values of total domination numbers of these graphs and we deduce the total domination numbers of some Cartesian products of cycles. Finally, we investigate the problem of total domination numbers for some Cartesian products of two paths.
Reviewer: Lutz Volkmann (Aachen)
WorldCat.org
Valid XHTML 1.0 Transitional Valid CSS!