On the Total Domination Number of Cartesian Products of Graphs
โ Scribed by Michael A. Henning; Douglas F. Rall
- Publisher
- Springer Japan
- Year
- 2005
- Tongue
- English
- Weight
- 261 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this communication the domination number of the cross product of an elementary path with the complement of another path is exactly determined and some inequalities for general cases are deduced. The paper ends with a Vizing-like conjecture relating the domination number of the cross product of G
We show the link between the existence of perfect Lee codes and minimum dominating sets of Cartesian products of paths and cycles. From the existence of such a code we deduce the asymptotical values of the domination numbers of these graphs.