A note on tree isomorphisms
β Scribed by A.R Bednarek
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 139 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Let Tp be any tree of order p and A ( T p ) stand for the maximum degree of the vertices of Tp. We prove the following theorem. "If A(Tp) 5 pi, where p > 2i, then Tp is i-placeable in Kp" is true if and only if i = 1, 2, and 3. 0 1996 John Wiley & Sons, Inc. Suppose G is a graph and V ( G ) , E ( G
## 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