On domination numbers of Cartesian produ
β
Sylvain Gravier; Michel Mollard
π
Article
π
1997
π
Elsevier Science
π
English
β 234 KB
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.