Isometric Embeddings of Finite Metric Trees into (Rn,d1) and (Rn,d∞)

Abstract

We investigate isometric embeddings of finite metric trees into (Rn,d1) and ( Rn, d∞). We prove that a finite metric tree can be isometrically embedded into (Rn,d1) if and only if the number of its leaves is at most 2n. We show that a finite star tree with at most 2n leaves can be isometrically embedded into (Rn, d∞) and a finite metric tree with more than 2n leaves cannot be isometrically embedded into (Rn, d∞). We conjecture that an arbitrary finite metric tree with at most 2n leaves can be isometrically embedded into (Rn, d∞).

0

Discussion (0)

Sign in to join the discussion.

Loading comments…