A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Having a dynamical system on the vertex set of a finite tree, one can construct the corresponding Markov graph which is the digraph that encodes covering relation between edges in a tree. Representatives of isomorphism classes of Markov graphs are called M-graphs. In this paper we prove that the class of M-graphs is closed under several prescribed digraph transformations (such as deletion of a vertex in a digraph or taking the disjoint union of digraphs, for example). We also give a completedoi:10.37560/matbil17200022k fatcat:pac7bwmeqbgn5pgpztoti5kw6i