Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949706 | Discrete Applied Mathematics | 2017 | 11 Pages |
Abstract
In this paper we find some equalities and inequalities characterizing the families of real numbers parametrized by the k-subsets of {1,â¦,n} that are the families of k-weights of weighted trees whose leaf set is equal to {1,â¦,n} and whose weights of the internal edges are positive (where we say that an edge e is internal if there exists a path with endpoints of degree greater than 2 and containing e).
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Agnese Baldisserri, Elena Rubei,