On the weak $k$-metric dimension of Hamming graphs

Elena Fernandez, Sandi Klavzar, Dorota Kuziak +2

Given a connected graph $G$, a set of vertices $X\subset V(G)$ is a weak $k$-resolving set of $G$ if for each two vertices $y,z\in V(G)$, the sum of the values $|d_G(y,x)-d_G(z,x)|…