Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T03:04:27.628Z Has data issue: false hasContentIssue false

A Characterization of Certain Ptolemaic Graphs

Published online by Cambridge University Press:  20 November 2018

David C. Kay
Affiliation:
Michigan State University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

With every connected graph G there is associated a metric space M(G) whose points are the vertices of the graph with the distance between two vertices a and b defined as zero if a = b or as the length of any shortest arc joining a and b if a ≠ b. A metric space M is called a graph metric space if there exists a graph G such that M = M (G), i.e., if there exists a graph G whose vertex set can be put in one-to-one correspondence with the points of M in such a way that the distance between every two points of M is equal to the distance between the corresponding vertices of G.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1965