| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649709 | Discrete Mathematics | 2008 | 5 Pages |
Abstract
We give lower and upper bounds on the total domination number of the cross product of two graphs, γt(G×H)γt(G×H). 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 γt(G×Pn)γt(G×Pn) and γt(Cn×Cm)γt(Cn×Cm) where PnPn and CnCn denote, respectively, a path and a cycle of length nn.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Mohamed El-Zahar, Sylvain Gravier, Antoaneta Klobucar,