| dc.contributor.author | Kuziak, Dorota | |
| dc.contributor.author | Puertas, María Luz | |
| dc.contributor.author | Rodríguez Velázquez, J.A. | |
| dc.contributor.author | González Yero, Ismael | |
| dc.contributor.other | Estadística e Investigación Operativa | es_ES |
| dc.contributor.other | Matemáticas | es_ES |
| dc.date.accessioned | 2024-02-08T14:24:51Z | |
| dc.date.available | 2024-02-08T14:24:51Z | |
| dc.date.issued | 2018-02-19 | |
| dc.identifier.issn | 0166-218X | |
| dc.identifier.uri | http://hdl.handle.net/10498/30891 | |
| dc.description.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. | es_ES |
| dc.format | application/pdf | es_ES |
| dc.language.iso | eng | es_ES |
| dc.publisher | Elsevier | es_ES |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.source | Discrete Applied Mathematics - 2018, Vol. 236 pp. 270–287 | es_ES |
| dc.subject | Strong resolving graph | es_ES |
| dc.subject | strong metric dimension | es_ES |
| dc.subject | graphs transformations | es_ES |
| dc.title | Strong resolving graphs: the realization and the characterization problems | es_ES |
| dc.type | journal article | es_ES |
| dc.rights.accessRights | open access | es_ES |
| dc.identifier.doi | 10.1016/j.dam.2017.11.013 | |
| dc.type.hasVersion | AM | es_ES |