This paper presents certain definitions, results and problems concerning the problem of representing a finite metric space with integer distances within a graph. Results are derived for the special cases of “regular” metric spaces, very small metric spaces, and for those metric spaces contained by cycles and trees. It is shown that a tree is the smallest container of the metric space defined on its leaves.
