A New Lower Bound for the Domination Number of Complete Cylindrical Grid Graphs
Abstract
We use a dynamic programming algorithm to establish a lower bound on the domination number of complete grid graphs of the form Cn Pm, that is, the Cartesian product of a cycle Cn and a path Pm, for m and n sufficiently large.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.