On disjoint union of M-graphs
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 dis...
Збережено в:
| Опубліковано в: : | Algebra and Discrete Mathematics |
|---|---|
| Дата: | 2017 |
| Автор: | |
| Формат: | Стаття |
| Мова: | Англійська |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2017
|
| Онлайн доступ: | https://nasplib.isofts.kiev.ua/handle/123456789/156635 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | On disjoint union of M-graphs / S. Kozerenko // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 2. — С. 262-273. — Бібліогр.: 10 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862533028146839552 |
|---|---|
| author | Kozerenko, S. |
| author_facet | Kozerenko, S. |
| citation_txt | On disjoint union of M-graphs / S. Kozerenko // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 2. — С. 262-273. — Бібліогр.: 10 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | 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.
|
| first_indexed | 2025-11-24T06:35:33Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-156635 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-11-24T06:35:33Z |
| publishDate | 2017 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Kozerenko, S. 2019-06-18T18:10:42Z 2019-06-18T18:10:42Z 2017 On disjoint union of M-graphs / S. Kozerenko // Algebra and Discrete Mathematics. — 2017. — Vol. 24, № 2. — С. 262-273. — Бібліогр.: 10 назв. — англ. 1726-3255 2010 MSC:05C20, 37E25, 37E15. https://nasplib.isofts.kiev.ua/handle/123456789/156635 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. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics On disjoint union of M-graphs Article published earlier |
| spellingShingle | On disjoint union of M-graphs Kozerenko, S. |
| title | On disjoint union of M-graphs |
| title_full | On disjoint union of M-graphs |
| title_fullStr | On disjoint union of M-graphs |
| title_full_unstemmed | On disjoint union of M-graphs |
| title_short | On disjoint union of M-graphs |
| title_sort | on disjoint union of m-graphs |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/156635 |
| work_keys_str_mv | AT kozerenkos ondisjointunionofmgraphs |