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

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.

[1]  Ortrud R. Oellermann,et al.  The metric dimension of Cayley digraphs , 2006, Discret. Math..

[2]  M. Cangalovic,et al.  COMPUTING STRONG METRIC DIMENSION OF SOME SPECIAL CLASSES OF GRAPHS BY GENETIC ALGORITHMS , 2008 .

[3]  Nael B. Abu-Ghazaleh,et al.  Virtual Coordinates with Backtracking for Void Traversal in Geographic Routing , 2006, ADHOC-NOW.

[4]  Milica Stojanovic,et al.  Minimal doubly resolving sets and the strong metric dimension of some convex polytopes , 2012, Appl. Math. Comput..

[5]  José Cáceres,et al.  On the metric dimension of some families of graphs , 2005, Electron. Notes Discret. Math..

[6]  Nael B. Abu-Ghazaleh,et al.  Virtual Coordinate Backtracking for Void Traversal in Geographic Routing , 2005, ArXiv.

[7]  Thomas Erlebach,et al.  Network Discovery and Verification , 2005, IEEE Journal on Selected Areas in Communications.

[8]  András Sebö,et al.  On Metric Generators of Graphs , 2004, Math. Oper. Res..

[9]  Jozef Kratica,et al.  Computing minimal doubly resolving sets of graphs , 2009, Comput. Oper. Res..

[10]  Gary Chartrand,et al.  Resolvability in graphs and the metric dimension of a graph , 2000, Discret. Appl. Math..

[11]  James D. Currie,et al.  The metric dimension and metric independence of a graph , 2001 .

[12]  Thomas Erlebach,et al.  Network Discovery and Verification , 2005, WG.

[13]  Muhammad Imran,et al.  On families of convex polytopes with constant metric dimension , 2010, Comput. Math. Appl..

[14]  N. Duncan.  Leaves on trees , 2014 .

[15]  P. Cameron,et al.  Base size, metric dimension and other invariants of groups and graphs , 2011 .

[16]  Ortrud R. Oellermann,et al.  The strong metric dimension of graphs and digraphs , 2007, Discret. Appl. Math..

[17]  Azriel Rosenfeld,et al.  Landmarks in Graphs , 1996, Discret. Appl. Math..

[18]  Jozef Kratica,et al.  Computing the metric dimension of graphs by genetic algorithms , 2009, Comput. Optim. Appl..

[19]  David R. Wood,et al.  On the Metric Dimension of Cartesian Products of Graphs , 2005, SIAM J. Discret. Math..