Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2512.07672 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908698336559104 |
|---|---|
| author | Gispert-Fernandez, Adria Rodriguez-Velazquez, Juan A. Yero, Ismael G. |
| author_facet | Gispert-Fernandez, Adria Rodriguez-Velazquez, Juan A. Yero, Ismael G. |
| contents | Given a connected graph $G$, the equidistant dimension of $G$ represents the cardinality of the smallest set of vertices $S$ of $G$ such that for any two vertices $x,y\notin S$ there is at least one vertex in $S$ equidistant to both $x,y$ in terms of distances. In this article, we compute the equidistant dimension of some Cartesian product graphs including two-dimensional Hamming graphs, some hypercubes, prisms of cycle, and squared grid graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_07672 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Equidistant dimension of Cartesian product graphs Gispert-Fernandez, Adria Rodriguez-Velazquez, Juan A. Yero, Ismael G. Combinatorics Given a connected graph $G$, the equidistant dimension of $G$ represents the cardinality of the smallest set of vertices $S$ of $G$ such that for any two vertices $x,y\notin S$ there is at least one vertex in $S$ equidistant to both $x,y$ in terms of distances. In this article, we compute the equidistant dimension of some Cartesian product graphs including two-dimensional Hamming graphs, some hypercubes, prisms of cycle, and squared grid graphs. |
| title | Equidistant dimension of Cartesian product graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2512.07672 |