Strong resolving graphs: the realization and the characterization problems
Kuziak, D. · Puertas, M. L. · Rodriguez-Velazquez, J. A. · Yero, I. G.
Original · EN
The strong resolving graph GSR 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 GSR. Since then, several articles dealing with this subject have been published. In this paper, we survey the state of knowledge on the strong resolving graph and also derive some new results.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.