arXiv (All)
open access
Minimal Resolving Sets in Rectangular Grid Graphs: A Complete Characterization and Enumeration
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 r
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Arranging circles of radii 1,2,...,n around a central circle: a Supnick TSP and certified finite optima#1123180
- On the Complexity of Finding Fixed Points for Set-Valued Contractions#1083573
- On the representation number of chessboard graphs#1036994
- A Note on Triple Repetition Sequence of Domination Number in Graphs#722491
- An Improved Upper Bound for Multicolour Ramsey Numbers#927869
Record · ID 1130738
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive