The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Sets of double and triple weights of trees
[article]
2011
arXiv
pre-print
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
arXiv:0712.3026v3
fatcat:qsxbzinqfrbjnnvzz7dcl3qa3u