On the metric dimension of corona product graphs
I. G. Yero, D. Kuziak, J. A. Rodriguez-Velazquez

TL;DR
This paper investigates the metric dimension of recursive corona product graphs, providing formulas for its calculation based on properties of the component graphs, especially focusing on diameter and specific graph types.
Contribution
It introduces new formulas for the metric dimension of iterated corona product graphs, extending understanding of how graph parameters influence resolving sets.
Findings
If the diameter of H is at most two, then dim(G⊙^k H) = n₁(n₂+1)^{k-1} dim(H).
For n₂ ≥ 7 and diameter of H > 5 or H is a cycle, dim(G⊙^k H) = n₁(n₂+1)^{k-1} dim(K₁⊙ H).
Provides recursive formulas for the metric dimension of complex graph constructions.
Abstract
Given a set of vertices of a connected graph , the metric representation of a vertex of with respect to is the vector , where , denotes the distance between and . is a resolving set for if for every pair of vertices of , . The metric dimension of , , is the minimum cardinality of any resolving set for . Let and be two graphs of order and , respectively. The corona product is defined as the graph obtained from and by taking one copy of and copies of and joining by an edge each vertex from the -copy of with the -vertex of . For any integer , we define the graph recursively from as .…
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.
