Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words
International Journal of Mathematics and Mathematical Sciences · 2026-01 · 2026 (1)
DOI: 10.1155/ijmm/1411005 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Mathematics and Mathematical Sciences, online erschienen am 12.06.2026. Verfasst von Julian Allagan und 3 weiteren Autor:innen. Die Arbeit nennt 10 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: U.S. Department of Education.
Abstract (Originalsprache)
Let G n = C n □ P 2 be the prism graph on 2 n vertices. The dominion ζ ( G n ) counts the minimum dominating sets of G n . Encoding column selections as cyclic words over a quaternary alphabet converts domination into explicit local adjacency constraints, reducing the count of minimum dominating sets to the enumeration of minimum‐weight admissible words. This yields closed‐form formulas for ζ ( G n ) for all n ≥ 3, stratified by n mod 4, with the exceptional cases n ∈ {3, 6} confirmed by exhaustive computation.
Förderung
- U.S. Department of Education
Zitieren
APA
Allagan, J., Deriglazov, V., Lopez-Bonilla, R. N., & Pereyra, K. (2026). Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words. International Journal of Mathematics and Mathematical Sciences, 2026(1). https://doi.org/10.1155/ijmm/1411005
Vancouver
Allagan J, Deriglazov V, Lopez-Bonilla RN, Pereyra K. Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words. International Journal of Mathematics and Mathematical Sciences. 2026;2026(1). doi:10.1155/ijmm/1411005
BibTeX
@article{Allagan2026,
author = {Allagan, Julian and Deriglazov, Vladimir and Lopez-Bonilla, Rogelio N. and Pereyra, Kevin},
title = {Exact Dominion of the Prism Graph: Enumeration by Congruence Class via Cyclic Words},
journal = {International Journal of Mathematics and Mathematical Sciences},
year = {2026},
volume = {2026},
number = {1},
doi = {10.1155/ijmm/1411005}
}
EUVIMED