On expansive and anti-expansive tree maps

With every self-map on the vertex set of a finite tree one can associate the directed graph of a special type which is called the Markov graph. Expansive and anti-expansive tree maps are two extremal classes of maps with respect to the number of loops in their Markov graphs. In this paper we prove that a tree with at least two vertices has a perfect matching if and only if it admits an expansive cyclic permutation of its vertices. Also, we show that for every tree with at least three vertices there exists an expansive map with a weakly connected (strongly connected provided the tree has a perfect matching) Markov graph as well as anti-expansive map with a strongly connected Markov graph