论文标题
完整圆柱网格图的统治数量的新下限
A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs
论文作者
论文摘要
我们使用动态编程算法在$ c_n \ square p_m $的完整网格图的统治数上建立一个下限，也就是说，是循环$ c_n $的笛卡尔产品和$ m $ $ $ $和$ n $的笛卡尔产品。
We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form $C_n\square P_m$, that is, the Cartesian product of a cycle $C_n$ and a path $P_m$, for $m$ and $n$ sufficiently large.
