Abstract
A set of vertices {\em resolves} a graph if every vertex of is uniquely determined by its vector of distances to the vertices in . The {\em metric dimension} for , denoted by , is the minimum cardinality of a resolving set of . In order to study the metric dimension for the hierarchical product of two rooted graphs and , we first introduce a new parameter, the {\em rooted metric dimension} $\rdim(G_1^{u_1})$ for a rooted graph . If is not a path with an end-vertex , we show that $\dim(G_2^{u_2}\sqcap G_1^{u_1})=|V(G_2)|\cdot\rdim(G_1^{u_1})$, where is the order of . If is a path with an end-vertex , we obtain some tight inequalities for . Finally, we show that similar results hold for the fractional metric dimension.
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.