Treelike families of multiweights

Abstract

Let T=(T,w) be a weighted finite tree with leaves 1,..., n. For any I :=\i1,..., ik \ ⊂ \1,...,n\, let DI ( T) be the weight of the minimal subtree of T connecting i1,..., ik; the DI ( T) are called k-weights of T. Given a family of real numbers parametrized by the k-subsets of \1,..., n\, \DI\I ∈ \1,...,n\ k, we say that a weighted tree T=(T,w) with leaves 1,..., n realizes the family if DI( T)=DI for any I . We give a characterization of the families of real numbers that are realized by some weighted tree.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…