Distance-based vertex identification in graphs: the outer multiset dimension

Abstract: Given a graph $G$ and a subset of vertices $S = {w_1, \ldots, w_t} \subseteq V(G)$, the multiset representation of a vertex $u\in V(G)$ with respect to $S$ is the multiset $m(u|S) = {| d_G(u, w_1), \ldots, d_G(u, w_t) |}$. A subset of vertices $S$ such that $m(u|S) = m(v|S) \iff u = v$ for every $u, v \in V(G) \setminus S$ is said to be a multiset resolving set, and the cardinality of the smallest such set is the outer multiset dimension. We study the general behaviour of the outer multiset dimension, and determine its exact value for several graph families. We also show that computing the outer multiset dimension of arbitrary graphs is NP-hard, and provide methods for efficiently handling particular cases.