Characterization of geodesic distance on infinite graphs
Abstract
Let G be a connected graph and let dG be the geodesic distance on V(G). The metric spaces (V(G), dG) 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), dG) for suitable G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.