On the weak k-metric dimension of Hamming graphs

Given a connected graph G , a set of vertices X ⊂ V ( G ) is a weak k -resolving set of G if for each two vertices y , z ∈ V ( G ) , the sum of the values | d G ( y , x ) − d G ( z , x ) | over all x ∈ X is at least k , where d G ( u , v ) stands for the length of a shortest path between u and v . The cardinality of a smallest weak k -resolving set of G is the weak k -metric dimension of G , and is denoted by wdim k ( G ) . In this paper, wdim k ( K n □ K n ) is determined for every n ≥ 3 and every 2 ≤ k ≤ 2 n . An improvement of a known integer linear programming formulation for this problem is developed and implemented for the graphs K n □ K m . Conjectures regarding these general situations are posed.