Non-wandering points and the depth of a graph map
2000 ◽
Vol 69
(2)
◽
pp. 143-152
◽
Keyword(s):
AbstractLef: G → G be a continuous map of a graph and let d(A) denote the derived set (or limit points) of A ⊂ G. We prove that d(Ω(f)) ⊂ λ (f) and the depth of f is at most three. We also prove that if f is piecewise monotone or has zero topological entropy, then the depth of f is at most two. Furthermore, we obtain some results on the topological structure of Ω(f).
1986 ◽
Vol 6
(3)
◽
pp. 335-344
◽
Keyword(s):
1995 ◽
Vol 05
(05)
◽
pp. 1433-1435
Keyword(s):
2004 ◽
Vol 14
(04)
◽
pp. 1489-1492
◽
1991 ◽
Vol 44
(2)
◽
pp. 207-213
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol 22
(08)
◽
pp. 1250195
◽
Keyword(s):
2001 ◽
Vol 25
(2)
◽
pp. 119-127
◽
2005 ◽
Vol 21
(4)
◽
pp. 873-880