New Results on Vertices that Belong to Every Minimum Locating-Dominating Code

Abstract

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.

Figures (6)

• Figure 1: The black vertices are shown to be min-forced in their respective graphs.
• Figure 2: The vertex $v_8$ is min-forced as can be verified using Theorem \ref{['theo:forced-characterization']}(ii).
• Figure 3: The illustration using the path $P_{10}$.
• Figure 4: The different categories of LD-codes illustrated. The black and white vertices represent the codewords and non-codewords, respectively.
• Figure 5: The categories of LD*-codes illustrated.

Theorems & Definitions (30)

• Definition 1.1
• Definition 1.2
• Definition 1.3
• Definition 1.4
• Lemma 1.5: slater1987domination
• Definition 1.6
• Theorem 1.7
• proof
• Theorem 2.1
• proof