✦ LIBER ✦

A combinatorial family of labeled trees

✍ Scribed by Paul Klingsberg

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 153 KB
Volume: 1
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(80)90008-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Combinatorial Construction For Twin Tr

A Combinatorial Construction For Twin Trees

✍ D.G. Fon-Der-Flaass 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 306 KB

A General Random Combinatorial Model of

A General Random Combinatorial Model of Botanical Trees

✍ Paul Kruszewski; Sue Whitesides 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 406 KB

We present a new mathematical model of botanical trees capable of simulating the combinatorial structure of specific species based on their bifurcation ratios. We first describe a general combinatorial model of botanical trees for the purposes of synthetic imagery. We apply techniques from probabili

Some combinatorial properties of dyadic

Some combinatorial properties of dyadic trees

✍ L.A. Khizder 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 296 KB

A combinatorial description of the close

A combinatorial description of the closest tree algorithm for finding evolutionary trees

✍ Michael D. Hendy 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 382 KB

The closest tree algorith¢a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va

Convex labelings of trees

✍ Stephen J. Dow; Douglas F. Rall; Peter J. Slater 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 456 KB

A convex labeling of a tree T o f order n is a one-to-one function f from the vertex set of Tinto the nonnegative integers, so that f ( y ) 5 ( f ( x ) t f(z))/2 for every path x, y, z of length 2 in T. If, in addition, f (v) I n -1 for every vertex v of T, then f is a perfect convex labeling and T

Forests of label-increasing trees

✍ John Riordan 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

Label-increasing trees are fully labeled rooted trees with the restriction that the labels are in increasing order on every path from the root; the best known example is the binary case-no tree with more than two branches at the root, or internal vertices of degree greater than threeextensively exam