arXiv (All)
open access
Optimal $(1,\le \ell)$-locating-dominating codes in infinite triangular grid
We study two variants of location-domination in infinite triangular grids which allow locating up to $\ell$ vertices simultaneously. A locating-dominating code $S$ is a dominating vertex set such that every vertex outside of it has a unique neighborhood within the code $S$. As this neighborhood is u
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
- On $k$-limited domination: complexity and Sierpiński graphs#1156855
- Deterministic Distributed Linearly Separable Computation via Nested Cyclic Codes#1343700
- On $k$-limited domination: complexity and Cartesian products#1156397
- Strong coloring numbers of grids#1356842
- Binary Firefly algorithm for the set covering problem [Algoritmo Luciérnaga Binario para el Problema de Cobertura de Conjuntos]#948660
Record · ID 1187905
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