A method to determine the least central subtree of a tree is given. The structure of the trees having a single point as a least central subtree is described, and the relation of a least central subtree of a tree to the centroid as well as to the center of that tree is given.
β¦ LIBER β¦
On the probability of occurrence of labelled subtrees of a randomly labelled tree
β Scribed by F.M. Dekking
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 224 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The subtree center of a tree
β
Nieminen, Juhani; Peltola, Matti
π
Article
π
1999
π
John Wiley and Sons
π
English
β 107 KB
π 2 views
A combinatorial family of labeled trees
β
Paul Klingsberg
π
Article
π
1980
π
Elsevier Science
π
English
β 153 KB
On the average number of nodes in a subt
β
Robert E Jamison
π
Article
π
1983
π
Elsevier Science
π
English
β 844 KB
A theorem on labelled trees and the limi
β
Helmut Pfeiffer
π
Article
π
1990
π
John Wiley and Sons
π
English
β 785 KB
Bipartite labelings of trees and the gra
β
Alexander Rosa; Jozef Ε irΓ‘Ε
π
Article
π
1995
π
John Wiley and Sons
π
English
β 681 KB
## Abstract Let __T__ = (__V, E__) be a tree whose vertices are properly 2βcolored. A bipartite labeling of __T__ is a bijection __f__: __V__ β {0, 1, β, | __E__ |} for which there is a __k__ such that whenever __f__(__u__) β€ __k__ < __f__(__v__), then __u__ and __v__ have different colors. The Ξ±βs
On the log-product of the subtree-sizes
β
A. Meir; J. W. Moon
π
Article
π
1998
π
John Wiley and Sons
π
English
β 190 KB
π 2 views
We determine the asymptotic behavior of the expected value and the variance of the log-product of the subtree-sizes of trees T belonging to simply generated families of n