Answers are grounded in this paper and cite their sources.
Let G be a connected graph. A vertex w strongly resolves two different vertices u,v of G if there exists a shortest u−w path, which contains the vertex v or a shortest v−w path, which contains the vertex u. A set W of vertices is a strong metric generator for G if every pair of different vertices of G is strongly resolved by some vertex of W. The smallest cardinality of a strong metric generator for G is called the strong metric dimension of G. It is known that the problem of computing this invariant is NP-hard. According to that fact, in this paper we study the problem of computing exact values or sharp bounds for the strong metric dimension of the rooted product of graphs and express these in terms of invariants of the factor graphs.
No takes yet. Share an insight, caveat, or question.
Kuziak et al. (2015) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: