Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words
Abstract
Let Gn = Cn square P2 denote the prism (circular ladder) graph on 2n vertices. By encoding column configurations as cyclic words, domination is reduced to local Boolean constraints on adjacent factors. This framework yields explicit formulas for the dominion zeta(Gn), stratified by n mod 4, with the exceptional cases n in 3, 6 confirmed computationally. Together with the known domination numbers gamma(Gn), these results expose distinct arithmetic regimes governing optimal domination, ranging from rigid forcing to substantial enumerative flexibility, and motivate quantitative parameters for assessing structural robustness in parametric graph families.
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.