@misc{10498/30891,
year = {2018},
month = {2},
url = {http://hdl.handle.net/10498/30891},
abstract = {The  strong resolving graph $G_{SR}$ of a connected graph $G$ was introduced in [Discrete Applied Mathematics 155 (1) (2007) 356--364] as a tool to study the strong metric dimension of $G$. Basically, it was shown  that the problem of finding the strong metric dimension of $G$ can be transformed to the problem of finding the vertex cover number of  $G_{SR}$.
Since then, several articles on the strong metric dimension of graphs which are using this tool have been published. However, the tool itself  has remained unnoticed as a properly structure. In this paper, we survey the state of knowledge on the strong resolving graphs, and also derive some new results regarding its properties.},
publisher = {Elsevier},
keywords = {Strong resolving graph},
keywords = {strong metric dimension},
keywords = {graphs transformations},
title = {Strong resolving graphs: the realization and the characterization problems},
doi = {10.1016/j.dam.2017.11.013},
author = {Kuziak, Dorota and Puertas, María Luz and Rodríguez Velázquez, J.A. and González Yero, Ismael},
}