Dependence of tree copy functions
暂无分享，去创建一个
The graph copy function when restricted to the set of trees or of rooted trees is called the tree copy function or the rooted tree copy function, respectively. We show that both the set of tree copy functions and the set of rooted tree copy functions are strongly linearly independent. We also show that the set of all tree copy functions are algebraically independent but the set of all rooted tree copy functions are not. An algebraic base for the algebra generated by rooted tree copy functions is constructed in this paper.
[1] Endre Szemerédi,et al. On subgraph number independence in trees , 1978, J. Comb. Theory, Ser. B.
[2] J. Spencer,et al. Strong independence of graph copy functions , 1978 .
[3] Hassler Whitney,et al. The Coloring of Graphs , 1932 .
[4] Lih-Hsing Hsu. Monotone multiplicative graph functions and dependence of tree copy functions , 1981 .