On strongly connected Markov graphs of maps on combinatorial trees

Simple item page
dc.contributor.authorKozerenko, Sergiyen_US
dc.date.accessioned2025-04-02T08:10:39Z
dc.date.available2025-04-02T08:10:39Z
dc.date.issued2025
dc.description.abstractMarkov graphs form a special class of digraphs constructed from self-maps on the vertex sets of combinatorial trees. In this paper, the trees that admit cyclic permutations of their vertex sets with non-strongly connected Markov graphs in terms of the existence of a special subset of edges are characterized. Additionally, the structure of self-maps of finite sets, which produce strongly connected Markov graphs for all trees, is described. A similar question, concerning which self-maps produce strongly connected Markov graphs for some trees, is answered for the class of permutations.en_US
dc.identifier.citationKozerenko S. On strongly connected Markov graphs of maps on combinatorial trees / Sergiy Kozerenko // Discrete Mathematics Letters. - 2025. - Vol. 15. - P. 31-38. - https://doi.org/10.47443/dml.2024.218en_US
dc.identifier.issn2664-2557
dc.identifier.urihttps://doi.org/10.47443/dml.2024.218
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/34143
dc.language.isoenen_US
dc.relation.sourceDiscrete Mathematics Lettersen_US
dc.statusfirst publisheden_US
dc.subjecttreesen_US
dc.subjectpermutationsen_US
dc.subjectMarkov graphsen_US
dc.subjectstrongly connected digraphsen_US
dc.subjectarticleen_US
dc.titleOn strongly connected Markov graphs of maps on combinatorial treesen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kozerenko_On_strongly_connected_Markov_graphs_of_maps_on_combinatorial_trees.pdf
Size:
330.28 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Кафедра математики