Recurrent points and periodic points of graph maps
Let G be a graph and f is an element of C(0)(G). It is proved that   = G if   = G and P(f) not equal empty set. This result generalizes several corresponding results given in [3] and [10].
recurrent point periodic point graph map transitivity