On disjoint union of \(\mathrm{M}\)-graphs

• Дата: 2018
• Автор: Kozerenko, Sergiy
• Формат: Стаття
• Мова: English
• Опубліковано: Lugansk National Taras Shevchenko University 2018
• Теми: tree maps; Markov graphs; Sharkovsky's theorem; 05C20; 37E25; 37E15
• Онлайн доступ: https://admjournal.luguniv.edu.ua/index.php/adm/article/view/426
• Назва журналу: Algebra and Discrete Mathematics

Given a pair \((X,\sigma)\) consisting of a finite tree \(X\) and its vertex self-map \(\sigma\) one can construct the corresponding Markov graph \(\Gamma(X,\sigma)\) which is a digraph that encodes \(\sigma\)-covering relation between edges in \(X\). \(\mathrm{M}\)-graphs are Markov graphs up to is...