New Optimal Results on Codes for Location in Graphs

arXiv2306.07862MaRDI QIDQ6440180FDOQ6440180

Authors: Ville Junnila, Tero Laihonen, Tuomo Lehtilä 

Publication date: 13 June 2023

Abstract: 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}imes{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 $qgeq2$.

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Infinite graphs (05C63) Graph operations (line graphs, products, etc.) (05C76)

This page was built for publication: New Optimal Results on Codes for Location in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6440180)