Optimal and quasi-optimal locating-dominating densities in the infinite hexagonal grid with a finite number of rows
A set of vertices $S$ of a graph $G$ is locating-dominating if $S$ is dominating and, for each pair of distinct vertices not in $S$, their neighborhoods in $S$ are distinct. We present results on the minimum density of such sets in the infinite hexagonal grid with a finite number of rows $k$, also known as the hexagona...