TY  - GEN 
AU  - Kuziak, Dorota
AU  - González Yero, Ismael
AU  - Rodríguez Velázquez, J.A.
A4  - Estadística e Investigación Operativa
A4  - Matemáticas
PY  - 2013
SN  - 0166-218X
UR  - http://hdl.handle.net/10498/30922
AB  - Let $G$ be a connected graph. A vertex $w$  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 strong resolving set for...
LA  - eng
PB  - Elsevier
KW  - Strong metric dimension
KW  - strong resolving set
KW  - strong metric basis
KW  - clique number
KW  - corona product graph
KW  - join graph
TI  - On the strong metric dimension of corona product graphs and join graphs
DO  - 10.1016/j.dam.2012.10.009
ER  -