On disjoint union of M-graphs

dc.contributor.author	Kozerenko, S.
dc.date.accessioned	2019-06-18T18:10:42Z
dc.date.available	2019-06-18T18:10:42Z
dc.date.issued	2017
dc.identifier.citation	On disjoint union of M-graphs / S. Kozerenko // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 2. — С. 262-273. — Бібліогр.: 10 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC:05C20, 37E25, 37E15.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/156635
dc.description.abstract	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 disjoint union of M-graphs to be an M-graph and prove that each weak component of M-graph is an M-graph itself.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	On disjoint union of M-graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA