Minimal doubly resolving sets and the strong metric dimension of Hamming graphs

By Jozef Kratica, Vera V. Kovacevic-Vujcic, Mirjana Cangalovic, Milica Stojanović. 2012

58 citations recorded by the source corpus.

We consider the problem of determining the cardinality ψ(H2,k) of minimal doubly resolving sets of Hamming graphs H2,k. We prove that for k ≥ 6 every minimal resolving set of H2,k is also a doubly resolving set, and, consequently, ψ(H2,k) is equal to the metric dimension of H2,k, which is known from the literature. Moreover, we find an explicit expression for the strong metric dimension of all Hamming graphs Hn,k.

Subfields: Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/5695a2caab5d2daac6495f330eebb303518cb1c1