Characterization of the geodesic distance on infinite graphs
Let \(G\) be a connected graph and let \(d_G\) be the geodesic distance on \(V(G)\). The metric spaces \((V(G), d_{G})\) were characterized up to isometry for all finite connected \(G\) by David C. Kay and Gary Chartrand in 1965. The main result of this paper expands this characterization on infinite connected graphs. We also prove that every metric space with integer distances between its points admits an isometric embedding in \((V(G), d_G)\) for suitable \(G\).
Authors
- Oleksiy Dovgoshey (ORCID: https://orcid.org/0000-0001-9689-2303)
Publication Details
- Journal
- Utilitas Mathematica
- Published
- 2025-03-22
- DOI
- https://doi.org/10.61091/um122-05
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00