Strong resolving graphs: the realization and the characterization problems
Abstract
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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.