Locating-dominating codes have been studied widely since their introduction in the 1980s by Slater and Rall. In this paper, we concentrate on vertices that must belong to all minimum locating-dominating codes in a graph. We call them \emph{min-forced vertices}. We show that the number of min-forced vertices in a connected nontrivial graph of order $n$ is bounded above by $\frac{2}{3}\left(n -γ^{LD}(G)\right)$, where $γ^{LD}(G)$ denotes the cardinality of a minimum locating-dominating code. This implies that the maximum ratio between the number of min-forced vertices and the order of a connected nontrivial graph is at most $\frac{2}{5}$. Moreover, both of these bounds can be attained. In particular, the ratio $\frac{2}{5}$ is obtained by paths of order $5m$ having a unique minimum locating-dominating code of size $2m$. Furthermore, as a natural extension, we determine the number of different minimum locating-dominating codes in paths of all orders. In addition, we show that deciding whether a vertex is min-forced is co-NP-hard.

翻译：自Slater和Rall于20世纪80年代引入以来，定位支配码已被广泛研究。本文聚焦于图中必须属于所有最小定位支配码的顶点，并称之为最小强制顶点。我们证明，对于一个阶数为$n$的连通非平凡图，其最小强制顶点数的上界为$\frac{2}{3}\left(n -γ^{LD}(G)\right)$，其中$γ^{LD}(G)$表示最小定位支配码的基数。这意味着连通非平凡图中最小强制顶点数与阶数的最大比值至多为$\frac{2}{5}$。此外，这两个界均可达到。特别地，比值$\frac{2}{5}$由阶数为$5m$且具有唯一大小为$2m$的最小定位支配码的路图实现。进一步地，作为自然扩展，我们确定了所有阶数路图中不同最小定位支配码的数量。此外，我们证明判定一个顶点是否为最小强制顶点是co-NP难的。