TY  - GEN 
AU  - Rodríguez Velázquez, Juan A.
AU  - González Yero, Ismael
AU  - Kuziak, Dorota
AU  - Oellermann, Ortrud
A4  - Estadística e Investigación Operativa
A4  - Matemáticas
PY  - 2014
SN  - 0012-365X
UR  - http://hdl.handle.net/10498/30926
AB  - 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...
LA  - eng
PB  - Elsevier
KW  - Strong resolving set
KW  - strong metric dimension
KW  - Cartesian product of graphs
KW  - direct product of graphs
KW  - strong resolving graph
TI  - On the strong metric dimension of Cartesian and direct products of graphs
DO  - 10.1016/j.disc.2014.06.023
ER  -