Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

Optimal (1,≤ ℓ)-locating-dominating codes in infinite triangular grid

  • Soura Sena Das
  • Tuomo Lehtilä
  • Sagnik Sen
Open at sourcePDFDOICite

Abstract

We study two variants of location-domination in infinite triangular grids which allow locating up to ℓ 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 unique, we may use it as an identifier for locating the considered vertex outside of the vertex set. With the variants we study, we may also locate sets of vertices instead of only single vertices. In particular, we obtain the exact minimum densities of these types of sets in the infinite triangular grid for every value of ℓ.

Related

  1. A note on partitioning the vertex set of a graph into a dominating set and a locating dominating set
    Dipayan Chakraborty, Florent Foucaud, Michael A. Henning +1
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Optimal Kt-free list colorings and the Pollyanna property of graphs with no triangular wheel
    Hongyang Wang, Rong Wu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Infinite families of 3-designs from linear and nonlinear codes
    Shiyan Xiong, Xiaoqiang Wang, Dabin Zheng +1
    arXivPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsarXiv
  4. Optimal Quantum ( r , δ )-Locally Repairable Codes From Matrix-Product Codes
    Meng Cao, Kun Zhou
    IEEE Transactions on Information TheoryPeer-reviewedLicence not statedFull text13 citedCombinatorics & discrete mathematicsOpenAlex
  5. Generalized Semi-Infinite Programming for Robust Optimal Control with Decision-Dependent Uncertainty
    J. Wehbeh, E. C. Kerrigan, E. Scaccia
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv

Cite

BibTeXRIS
BibTeX
@misc{das2026optimal,
  title = {{Optimal $(1,\le \ell)$-locating-dominating codes in infinite triangular grid}},
  author = {Soura Sena Das and Tuomo Lehtilä and Sagnik Sen},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.03227},
  eprint = {2610.03227},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.03227},
}
RIS
TY  - UNPB
TI  - Optimal (1,≤ ℓ)-locating-dominating codes in infinite triangular grid
AU  - Soura Sena Das
AU  - Tuomo Lehtilä
AU  - Sagnik Sen
PY  - 2026
DA  - 2026/10/02
PB  - arXiv
DO  - 10.48550/arxiv.2610.03227
UR  - https://arxiv.org/abs/2610.03227
AB  - We study two variants of location-domination in infinite triangular grids which allow locating up to ℓ 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 unique, we may use it as an identifier for locating the considered vertex outside of the vertex set. With the variants we study, we may also locate sets of vertices instead of only single vertices. In particular, we obtain the exact minimum densities of these types of sets in the infinite triangular grid for every value of ℓ.
ER  -