𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on computing the similarity of binary trees

✍ Scribed by J.P. Jarvis; J.K. Luedeman; D.R. Shier

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
358 KB
Volume
100
Category
Article
ISSN
0022-5193

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Total Heights of Random Rooted Bi
On the Total Heights of Random Rooted Binary Trees
✍ L. Takacs πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 306 KB

Denote by \(S_{n}\) the set of all distinct rooted binary trees with \(n\) unlabeled vertices. Define \(\sigma_{n}\) as a total height of a tree chosen at random in the set \(S_{n}\), assuming that all the possible choices are equally probable. The total height of a tree is defined as the sum of the

On the Automorphism Group of the One-Roo
On the Automorphism Group of the One-Rooted Binary Tree
✍ A.M. Brunner; Said Sidki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 339 KB

Let A be the automorphism group of the one-rooted regular binary tree T and 2 G the subgroup of A consisting of those automorphisms admitting a ''finite Ε½ . description'' in their action on T . Let N G be the normaliser of G in A, let 2 A Ε½ . Ε½ . Aut G be the group of automorphisms of G, and let End