Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912806332268544 |
|---|---|
| author | Allagan, Julian |
| author_facet | Allagan, Julian |
| contents | Let G_n = C_n square P_2 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(G_n), stratified by n mod 4, with the exceptional cases n in {3, 6} confirmed computationally. Together with the known domination numbers gamma(G_n), 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_03488 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words Allagan, Julian Combinatorics Discrete Mathematics 05C69, 05C05, 05C30, 05A15 Let G_n = C_n square P_2 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(G_n), stratified by n mod 4, with the exceptional cases n in {3, 6} confirmed computationally. Together with the known domination numbers gamma(G_n), 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. |
| title | Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words |
| topic | Combinatorics Discrete Mathematics 05C69, 05C05, 05C30, 05A15 |
| url | https://arxiv.org/abs/2601.03488 |