New Optimal Results on Codes for Location in Graphs
Fundamenta Informaticae · 20.08.2026 · Volume 196, Issue 1
DOI: 10.46298/fi.11468 ↗Kurz gefasst
Fachartikel in der Zeitschrift Fundamenta Informaticae, online erschienen am 20.08.2026. Verfasst von Ville Junnila und 2 weiteren Autor:innen.
Abstract (Originalsprache)
In this paper, we broaden the understanding of the recently introduced concepts of solid-locating-dominating and self-locating-dominating codes in various graphs. In particular, we present the optimal, i.e., smallest possible, codes in the infinite triangular and king grids. Furthermore, we give optimal locating-dominating, self-locating-dominating and solid-locating-dominating codes in the direct product $K_n\times K_m$ of complete graphs. We also present optimal solid-locating-dominating codes for the Hamming graphs $K_q\square K_q\square K_q$ with $q\geq2$.
Zitieren
APA
Junnila, V., Laihonen, T., & Lehtilä, T. (2026). New Optimal Results on Codes for Location in Graphs. Fundamenta Informaticae, Volume 196, Issue 1. https://doi.org/10.46298/fi.11468
Vancouver
Junnila V, Laihonen T, Lehtilä T. New Optimal Results on Codes for Location in Graphs. Fundamenta Informaticae. 2026;Volume 196, Issue 1. doi:10.46298/fi.11468
BibTeX
@article{Junnila2026,
author = {Junnila, Ville and Laihonen, Tero and Lehtilä, Tuomo},
title = {New Optimal Results on Codes for Location in Graphs},
journal = {Fundamenta Informaticae},
year = {2026},
volume = {Volume 196, Issue 1},
doi = {10.46298/fi.11468}
}
EUVIMED