Isometric embeddings of finite metric trees into ( R^n, d₁) and ( R^n, d_)

From MaRDI portal
Publication:5137119



Abstract: We investigate isometric embeddings of finite metric trees into (mathbbRn,d1) and (mathbbRn,dinfty). We prove that a finite metric tree can be isometrically embedded into (mathbbRn,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 (mathbbRn,dinfty) and a finite metric tree with more than 2n leaves cannot be isometrically embedded into (mathbbRn,dinfty). We conjecture that an arbitrary finite metric tree with at most 2n leaves can be isometrically embedded into (mathbbRn,dinfty).












This page was built for publication: Isometric embeddings of finite metric trees into \(( \mathbb{R}^n, d_1)\) and \(( \mathbb{R}^n, d_\infty)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137119)