An optimal locating-dominating set in the infinite triangular grid (Q2433724): Difference between revisions

If \(G=(V,E)\) is a graph, \(U\) a subset of the vertex set \(V\) and \(v \in V\) an arbitrary vertex of \(G\), then the set of all elements \(u\) of \(U\) with distance \(d(u,v) \leq 1\) is denoted by \(I(v)\). If all sets \(I(v)\) for \(v \in V \setminus U\) are non-empty and pairwise different, then \(U\) is called a locating-dominating set. It is proved in this paper that the smallest possible density of a locating-dominating set in the infinite triangular grid is \(\frac{13}{57}\).