Periodic digraphs and their properties (Q1121903): Difference between revisions

\textit{P. Straffin} [Math. Mag. 51, 99-105 (1978; Zbl 0455.58022)] in his proof of the famous Sharkovsky theorem associated with a k-periodic point of a continuous function a digraph called periodic and showed that if a periodic digraph has a non-repetitive cycle of length k, then the function must have a k-periodic point. In the paper under review a necessary and sufficient condition for a digraph to be periodic is given.