The Equidistant Dimension of Corona Product Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915823024603136 |
|---|---|
| author | Tuñón-Andrés, Sandor E. Estrada-Moreno, Alejandro Rodríguez-Velázquez, Juan A. |
| author_facet | Tuñón-Andrés, Sandor E. Estrada-Moreno, Alejandro Rodríguez-Velázquez, Juan A. |
| contents | A subset $S$ of vertices, in a connected graph $G$, is called a distance-equalizer set if for every pair of distinct vertices outside $S$, there exists a vertex in $S$ equidistant to both. The equidistant dimension, denoted by $ξ(G)$, is defined as the minimum cardinality of such sets. While several distance-based parameters have been studied for different graph products, the equidistant dimension of corona product graphs has remained unexplored. In this paper, we investigate the equidistant dimension of the corona product $G \odot H$ of two graphs $G$ and $H$. We introduce the empty bisector graph $\widehat{G}$, an auxiliary construction that relates pairs of vertices in $G$ that cannot be equidistant from any third vertex. Using this framework, we establish tight bounds on the equidistant dimension of $G \odot H$ and derive exact values for several classical families of graphs. Moreover, we show that for any fixed base graph $G$, the equidistant dimension of $G \odot H$ depends on $H$ only through its order and eventually becomes linear in $\n(H)$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_23884 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The Equidistant Dimension of Corona Product Graphs Tuñón-Andrés, Sandor E. Estrada-Moreno, Alejandro Rodríguez-Velázquez, Juan A. Combinatorics 05C12, 05C76 A subset $S$ of vertices, in a connected graph $G$, is called a distance-equalizer set if for every pair of distinct vertices outside $S$, there exists a vertex in $S$ equidistant to both. The equidistant dimension, denoted by $ξ(G)$, is defined as the minimum cardinality of such sets. While several distance-based parameters have been studied for different graph products, the equidistant dimension of corona product graphs has remained unexplored. In this paper, we investigate the equidistant dimension of the corona product $G \odot H$ of two graphs $G$ and $H$. We introduce the empty bisector graph $\widehat{G}$, an auxiliary construction that relates pairs of vertices in $G$ that cannot be equidistant from any third vertex. Using this framework, we establish tight bounds on the equidistant dimension of $G \odot H$ and derive exact values for several classical families of graphs. Moreover, we show that for any fixed base graph $G$, the equidistant dimension of $G \odot H$ depends on $H$ only through its order and eventually becomes linear in $\n(H)$. |
| title | The Equidistant Dimension of Corona Product Graphs |
| topic | Combinatorics 05C12, 05C76 |
| url | https://arxiv.org/abs/2602.23884 |