2 papers
math.CO2026
The complexity of minimum-density locating-dominating set in infinite periodic graphs
Arthur C. Gomes, Yoshiko Wakabayashi
A dominating set of a graph is a locating-dominating set (LDS) if, for each pair of distinct vertices not in~, their neighbourhoods in are distinct. Finding a minimu…
math.CO2026
Optimal and quasi-optimal locating-dominating densities in the infinite hexagonal grid with a finite number of rows
Arthur C. Gomes, Yoshiko Wakabayashi
A set of vertices of a graph is locating-dominating if is dominating and, for each pair of distinct vertices not in , their neighborhoods in are distinct. We pre…