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.
The decomposition of trees into subtrees
β Scribed by Yair Caro
- Publisher
- John Wiley and Sons
- Year
- 1984
- Tongue
- English
- Weight
- 332 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
A necessary condition for the decomposition of a tree T into subtrees, each isomorphic to a tree from a given set of trees is presented. We also present a characterization of the set of trees for which the condition is sufficient. Many examples are given.
π SIMILAR VOLUMES
## Abstract We prove that if T is any tree having __n__ edges (__n__ β₯ 1), then the __n__βcube Q~n~ can be decomposed into 2^nβ1^ edgeβdisjoint induced subgraphs, each of which is isomorphic to T. We use this statement to obtain two results concerning decompositions of Q~n~ into subgraphs isomorphi
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