Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/4567
Title: | On disjoint union of M-graphs |
Authors: | Kozerenko, S. |
Keywords: | tree maps Markov graphs Sharkovsky’s theorem |
Issue Date: | 2017 |
Publisher: | ДЗ "ЛНУ імені Тараса Шевченка" |
Series/Report no.: | математичні науки; |
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. |
Description: | Kozerenko S. On disjoint union of M-graphs / S. Kozerenko // Algebra and Discrete Mathematics. - 2017. - Vol. 24. - Number 2. - Рp. 262-273 |
URI: | http://hdl.handle.net/123456789/4567 |
Appears in Collections: | Algebra and Discrete Mathematics. - № 2 (24). - 2017 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
426-2033-1-PB.pdf | 345.16 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.