Non-wandering set of a continuous graph map (Q1423955)

This paper is devoted to the structure of nonwandering sets generated by a graph map. They play an important role in dynamical systems. In this framework, the authors present a generalization of previous results: the Block ones in the case of interval maps, the Hosaka and Kato ones in the case of tree maps. For interval maps, Block called the union of the periodic point set and their increasing rank preimages ``set of eventually periodic points'', which implies that the map is noninvertible. He proved that the nonwandering set is contained into the closure of the set of eventually periodic points. But this result is generally not true for a graph map. The note introduces the notion of ``eventually recurrent points''. By discussing the orbit structure of nonwandering points, it is proved that the nonwandering set is contained into the closure of the set of eventually recurrent points. Moreover, after a study of limit points of the nonwandering set of a graph map, the authors show that the corresponding limit set is contained into the set of recurrent points.