On the metric dimension and fractional metric dimension for hierarchical product of graphs
Min Feng, Kaishun Wang

TL;DR
This paper investigates the metric and fractional metric dimensions of hierarchical product graphs, introducing a new rooted metric dimension parameter and deriving formulas and bounds for these dimensions.
Contribution
It introduces the rooted metric dimension for rooted graphs and establishes formulas and bounds for the metric and fractional metric dimensions of hierarchical product graphs.
Findings
Exact formula for metric dimension when $G_1$ is not a path.
Tight inequalities for the case when $G_1$ is a path.
Results extend to fractional metric dimension.
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} for a rooted graph . If is not a path with an end-vertex , we show that , 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
