拓扑可迁属性是刻划系统复杂性的重要概念.对树上连续自映射拓扑可迁性进行了探讨.将区间映射一些拓扑可迁属性推广到树映射上.指出:对树上连续自映射而言,拓扑混合等价于完全拓扑可迁,拓扑遍历等价于拓扑可迁,拓扑混合等价于拓扑弱混合.
This paper deals with topologically transitive tree maps. In terms of continuous maps of tree, topologically mixing and toally topologically transitive are identical, and topologically ergodic and topologically transitive are identical. Furthermore, so are topologically mixing and topologically weakly mixing.