Abstract: Let be a weighted finite tree with leaves . For any , let be the weight of the minimal subtree of connecting ; the are called -weights of . Given a family of real numbers parametrized by the -subsets of , , we say that a weighted tree with leaves realizes the family if for any . We give a characterization of the families of real numbers that are realized by some weighted tree.
Recommendations
Cites work
- A note on the metric properties of trees
- A note on the tree realizability of a distance matrix
- Basic phylogenetic combinatorics.
- Distance matrix of a graph and its realizability
- Families of multiweights and pseudostars
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 3243264 (Why is no real title available?)
- On dissimilarity vectors of general weighted trees
- On graphlike \(k\)-dissimilarity vectors
- Recognizing treelike k-dissimilarities
- Reconstructing trees from subtree weights.
- Sets of double and triple weights of trees
- Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
Cited in
(11)- Branch-weight unique trees
- Families of multiweights and pseudostars
- Weighted graphs with distances in given ranges
- On graphlike \(k\)-dissimilarity vectors
- On dissimilarity vectors of general weighted trees
- Weighted minimal binary trees
- A characterization of dissimilarity families of trees
- Characterization of distance matrices of weighted hypercube graphs and Petersen graphs
- Sets of double and triple weights of trees
- Moduli space of families of positive \((n - 1)\)-weights
- Management and analysis of DNA microarray data by using weighted trees
This page was built for publication: Treelike families of multiweights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2317178)