Journal article

Markov Graphs Of One–Dimensional Dynamical Systems And Their Discrete Analogues

Year:

2016

Published in:

Romanian Journal of Mathematics and Computer Science
Markov graph
one–dimensional dynamics
Sharkovsky’s theorem

Abstract. One feature of the famous Sharkovsky’s theorem is that it can be proved using digraphs of a special type (the so–called Markov graphs). The most general definition assigns a Markov graph to every continuous map from the topological graph to itself. We show that this definition is too broad, i.e. every finite digraph can be viewed as a Markov graph of some one–dimensional dynamical system on a tree. We therefore consider discrete analogues of Markov graphs for vertex maps on combinatorial trees and characterize all maps on trees whose discrete Markov graphs are of the following types: complete, complete bipartite, the disjoint union of cycles, with every arc being a loop

Other publications by

24 publications found

2025
Journal article

On Strongly Connected Markov Graphs Of Maps On Combinatorial Trees

Publisher: Discrete Mathematics Letters

Authors: Sergiy Kozerenko

2023
Journal article

Unique Eccentric Point Graphs And Their Eccentric Digraphs

Publisher: Discrete Mathematics

Authors: Sergiy Kozerenko, Artem Hak, Vladyslav Haponenko, Andrii Serdiuk

2024
Journal article

All‑Path Convexity: Two Characterizations, General Position Number, And One Algorithm

Publisher: Discrete Mathematics Letters

Authors: Sergiy Kozerenko, Vladyslav Haponenko

2020
Journal article

Periods In XOR Parallel Dynamical Systems Over Directed Dependency Graphs

Publisher: Applied Mathematics and Computation

Authors: Sergiy Kozerenko, Jose C. Valverde

2025
Journal article

Maps of combinatorial trees with weakly connected Markov graphs

Publisher: Utilitas Mathematica

Authors: Sergiy Kozerenko