Periodic digraphs and their properties
From MaRDI portal
\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.
Recommendations
Cites work
- A graph-theoretic proof of Sharkovsky's theorem on the periodic points of continuous functions
- scientific article; zbMATH DE number 4027497 (Why is no real title available?)
- scientific article; zbMATH DE number 3699890 (Why is no real title available?)
- Interval mapping graphs and periodic points of continuous functions
- Periodic Points of Continuous Functions
Cited in
(6)- Properties of digraphs connected with some congruence relations
- scientific article; zbMATH DE number 4027497 (Why is no real title available?)
- Linear and metric maps on trees via Markov graphs
- An Optimal Lower Bound for the Size of Periodic Digraphs
- Maps of combinatorial trees with weakly connected Markov graphs
- On strongly connected Markov graphs of maps on combinatorial trees
This page was built for publication: Periodic digraphs and their properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121903)
