Journal article

Maps of combinatorial trees with weakly connected Markov graphs

Year:

2025

Published in:

Utilitas Mathematica
trees
maps on nite sets
periodic points
Markov graphs
weakly connected digraphs

The Markov graph of a self-map on a combinatorial tree is a directed graph that encodes the covering relations between edges of the tree under the map. This work explores the dynamical structure of self-maps on trees with weakly connected Markov graphs. The main result of the paper is a complete characterization of self-maps on finite sets that yield weakly connected Markov graphs for all trees. Additionally, we describe the dynamical structure of self-maps whose Markov graphs take specific forms, including complete digraphs, cycles, paths, in-stars, and out-stars.

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

2016
Journal article

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

Publisher: Romanian Journal of Mathematics and Computer Science

Authors: Sergiy Kozerenko

2018
Journal article

On Expansive And Anti‑Expansive Tree Maps

Publisher: Opuscula Mathematica

Authors: Sergiy Kozerenko