Abstract
Let be a connected graph. A vertex {\em strongly resolves} a pair of vertices of if there exists some shortest path containing or some shortest path containing . A set of vertices is a {\em strong resolving set} for if every pair of vertices of is strongly resolved by some vertex of . The smallest cardinality of a strong resolving set for is called the {\em strong metric dimension} of . It is known that the problem of computing the strong metric dimension of a graph is NP-hard. In this paper we obtain closed formulae for the strong metric dimension of several families of Cartesian product graphs and direct product graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.