@misc{10498/30926,
year = {2014},
month = {11},
url = {http://hdl.handle.net/10498/30926},
abstract = {Let $G$ be a connected graph. A vertex $w$ {\em strongly resolves} a pair $u, v$ of vertices of $G$ if there exists some shortest
$u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a {\em strong resolving set} for $G$ if every pair of
vertices of $G$ is strongly resolved by some vertex of $W$. The smallest cardinality of a strong resolving set for $G$ is called the {\em strong metric dimension} of $G$. It is known  that the problem of computing the strong metric
dimension of a graph is NP-hard. In this paper we obtain closed formulae for the strong metric dimension of several families of the Cartesian product of graphs and the direct product of graphs.},
publisher = {Elsevier},
keywords = {Strong resolving set},
keywords = {strong metric dimension},
keywords = {Cartesian product of graphs},
keywords = {direct product of graphs},
keywords = {strong resolving graph},
title = {On the strong metric dimension of Cartesian and direct products of graphs},
doi = {10.1016/j.disc.2014.06.023},
author = {Rodríguez Velázquez, Juan A. and González Yero, Ismael and Kuziak, Dorota and Oellermann, Ortrud},
}