Metraipolis › archive › dc_e891c970dab0
Undirected edge geography games on stacked prism graphs — arXiv:2609.11409
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11409
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:13:51.784Z
- SHA-256 of the archived text
a5b4603718d656ac522fde32f698094033993a0af0462d183211a94c1a05c875- Stable URL of this page
https://metraipolis.com/documento/dc_e891c970dab0
How to cite
Undirected edge geography games on stacked prism graphs — arXiv:2609.11409 — arXiv (en), https://arxiv.org/abs/2609.11409 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e891c970dab0 (Metraipolis archive dc_e891c970dab0, sha256 a5b4603718d656ac522fde32f698094033993a0af0462d183211a94c1a05c875)
BibTeX
@misc{dce891c970dab0,
title = {Undirected edge geography games on stacked prism graphs — arXiv:2609.11409},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11409},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e891c970dab0; sha256 a5b4603718d656ac522fde32f698094033993a0af0462d183211a94c1a05c875},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11409. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The undirected edge geography is a two-player combinatorial game on an undirected graph. The players start at the root vertex and alternately move the root along an incident edge to its other endpoint and then delete that edge. The first player who has no remaining move is the loser. For positive integers $m$ and $n$ where $m\geq 3$, the stacked prism graph is $SP(m,n)=C_m\square P_n$. In this paper, we completely determine the winner of the game on $SP(2m,n)$ for $m\geq 2$ and $SP(m,2)$ for $m\geq 3$, and provide a winning strategy for the winner. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.11409 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T05:59:08.303Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).