Metraipolis › archive › dc_ea6089dad8f6
Minimal Resolving Sets in Rectangular Grid Graphs: A Complete Characterization and Enumeration — arXiv:2609.35896
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.35896
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:33:27.757Z
- SHA-256 of the archived text
55d29198fb5fac2d4192a21871dc22ae7a7f51f3341a27add937e51d06f8ef49- Stable URL of this page
https://metraipolis.com/documento/dc_ea6089dad8f6
How to cite
Minimal Resolving Sets in Rectangular Grid Graphs: A Complete Characterization and Enumeration — arXiv:2609.35896 — arXiv (en), https://arxiv.org/abs/2609.35896 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ea6089dad8f6 (Metraipolis archive dc_ea6089dad8f6, sha256 55d29198fb5fac2d4192a21871dc22ae7a7f51f3341a27add937e51d06f8ef49)
BibTeX
@misc{dcea6089dad8f6,
title = {Minimal Resolving Sets in Rectangular Grid Graphs: A Complete Characterization and Enumeration — arXiv:2609.35896},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.35896},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ea6089dad8f6; sha256 55d29198fb5fac2d4192a21871dc22ae7a7f51f3341a27add937e51d06f8ef49},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.35896. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $m,n \geq 3$. A set of vertices $S$ of the rectangular grid graph $P_m \square P_n$ is resolving if the taxicab distance vectors of the vertices of $P_m \square P_n$ with respect to $S$ are pairwise distinct. A resolving set $S$ is minimal if no proper subset of $S$ is resolving, and a minimal resolving set of cardinality $k$ is called a $k$-minimal. We extend the work of Andersen et al., who characterized $3$-minimals, established the maximum cardinality $2\min(m,n)-2$, and posed the complete characterization and enumeration of minimal resolving sets for grids as an open problem, and Adar and Epstein, who showed that $3$ is the only possible odd cardinality and that every minimal resolving set of cardinality at least $4$ can be ordered to form a sequence corresponding to a zigzag sequence. We provide a recursive construction that generates exactly the minimal resolving sets of cardinality at least $4$ for grids. We derive from the construction closed-form formulas to enumerate the $k$-minimals for all even $4 \leq k \leq 2\min(m,n) -2$. Together with the known characterizations for cardinalities $2$ and $3$ and a direct enumeration of the $3$-minimals, this yields a complete characterization and enumeration of the minimal resolving sets of rectangular grid graphs of every possible cardinality. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.35896 — 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-07T17:59:19.182Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).