The Domination Number of $C_n\square P_m$ for $n\equiv 2\pmod{5}$

We use a dynamic programming algorithm to establish a new lower bound on the domination number of complete cylindrical grid graphs of the form $C_{n} □ P_{m}$ , that is, the Cartesian product of a path and a cycle, when $n \equiv 2 (m o d 5)$ , and we establish a new upper bound equal to the lower bound, thus computing the exact domination number for these graphs.

The Domination Number of $C_{n} □ P_{m}$ for $n \equiv 2 (m o d 5)$

文献摘要

讨论

讲解博客

AI智能校验

The Domination Number of $C_{n} □ P_{m}$ for $n \equiv 2 (m o d 5)$

文献摘要

讨论

讲解博客

AI智能校验

The Domination Number of Cn□PmCn​□Pm​ for n≡2(mod5)n≡2(mod5)

文献摘要

讨论

|讲解博客

|AI智能校验

The Domination Number of Cn□PmCn​□Pm​ for n≡2(mod5)n≡2(mod5)

文献摘要

讨论

|讲解博客

|AI智能校验

The Domination Number of $C_{n} □ P_{m}$ for $n \equiv 2 (m o d 5)$

讲解博客

AI智能校验

The Domination Number of $C_{n} □ P_{m}$ for $n \equiv 2 (m o d 5)$

讲解博客

AI智能校验