On disjoint union of M-graphs

• Published in: Algebra and Discrete Mathematics
• Date: 2017
• Main Author: Kozerenko, S.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2017
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/156635
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: On disjoint union of M-graphs / S. Kozerenko // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 2. — С. 262-273. — Бібліогр.: 10 назв. — англ.

Given a pair (X,σ) consisting of a finite tree X and its vertex self-map σ one can construct the corresponding Markov graph Γ(X,σ) which is a digraph that encodes σ-covering relation between edges in X. M-graphs are Markov graphs up to isomorphism. We obtain several sufficient conditions for the dis...