English

Characterization of geodesic distance on infinite graphs

Combinatorics 2024-11-05 v3

Abstract

Let GG be a connected graph and let dGd_G be the geodesic distance on V(G)V(G). The metric spaces (V(G),dG)(V(G), d_{G}) are characterized up to isometry for all finite connected GG 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),dG)(V(G), d_G) for suitable GG.

Keywords

Cite

@article{arxiv.2408.02385,
  title  = {Characterization of geodesic distance on infinite graphs},
  author = {Oleksiy Dovgoshey},
  journal= {arXiv preprint arXiv:2408.02385},
  year   = {2024}
}

Comments

19 pages, 1 figure

R2 v1 2026-06-28T18:04:05.980Z