Kozerenko, S.
(Algebra and Discrete Mathematics, 2017)
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 ...