Characterization of geodesic distance on infinite graphs
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929573558484992 |
|---|---|
| author | Dovgoshey, Oleksiy |
| author_facet | Dovgoshey, Oleksiy |
| contents | Let $G$ be a connected graph and let $d_G$ be the geodesic distance on $V(G)$. The metric spaces $(V(G), d_{G})$ are characterized up to isometry for all finite connected $G$ by David C. Kay and Gary Chartrand in 1964. The main result of the paper expands this characterization on the infinite connected graphs. We also prove that every metric space with integer distances between its points admits an isometric embedding into $(V(G), d_G)$ for suitable $G$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_02385 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Characterization of geodesic distance on infinite graphs Dovgoshey, Oleksiy Combinatorics Primary 26A30, Secondary 54E35, 20M20 Let $G$ be a connected graph and let $d_G$ be the geodesic distance on $V(G)$. The metric spaces $(V(G), d_{G})$ are characterized up to isometry for all finite connected $G$ by David C. Kay and Gary Chartrand in 1964. The main result of the paper expands this characterization on the infinite connected graphs. We also prove that every metric space with integer distances between its points admits an isometric embedding into $(V(G), d_G)$ for suitable $G$. |
| title | Characterization of geodesic distance on infinite graphs |
| topic | Combinatorics Primary 26A30, Secondary 54E35, 20M20 |
| url | https://arxiv.org/abs/2408.02385 |