Sets of double and triple weights of trees

From MaRDI portal
Publication:659656

DOI10.1007/S00026-011-0118-1zbMATH Open1235.05036arXiv0712.3026OpenAlexW1977238738MaRDI QIDQ659656FDOQ659656

Elena Rubei

Publication date: 24 January 2012

Published in: Annals of Combinatorics (Search for Journal in Brave)

Abstract: Let T be a weighted tree with n leaves. Let D_{i,j} be the distance between the leaves i and j. Let D_{i,j,k}= (D_{i,j} + D_{j,k} +D_{i,k})/2. We will call such numbers "triple weights" of the tree. In this paper, we give a characterization, different from the previous ones, for sets indexed by 2-subsets of a n-set to be double weights of a tree. By using the same ideas,we find also necessary and sufficient conditions for a set of real numbers indexed by 3-subsets of an n-set to be the set of the triple weights of a tree with n leaves. Besides we propose a slight modification of Saitou-Nei's Neighbour-Joining algorithm to reconstruct trees from the data D_{i,j}.


Full work available at URL: https://arxiv.org/abs/0712.3026





Cites Work


Cited In (13)


   Recommendations





This page was built for publication: Sets of double and triple weights of trees

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