O dominantnem številu kartezičnega produkta poti in ciklov

Z uporabo algebraičnega pristopa implementiramo konstantni algoritem za računanje dominantnega števila kartezičnih produktov poti in ciklov. Podamo formule za dominantna števila ▫$gamma(P_n Box C_k)$▫ (za ▫$k leq 11$▫, ▫$n in {mathbb N}$)▫ in dominantna števila ▫$gamma(C_n Box P_k)$▫ in ▫$gamma(C_n Box C_k)$▫ (za ▫$k leq 6$▫, ▫$n in {mathbb N}$▫).Using algebraic approach we implement a constant time algorithm for computing the domination numbers of the Cartesian products of paths and cycles. Closed formulas are given for domination numbers ▫$gamma(P_n Box C_k)$▫ (for ▫$k leq 11$▫, ▫$n in {mathbb N}$▫) and domination numbers ▫$gamma(C_n Box P_k)$▫ and ▫$gamma(C_n Box C_k)$▫ (for ▫$k leq 6$▫, ▫$n in {mathbb N}$▫)