A formula for the number of weak endomorphisms on paths
A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths.
Збережено в:
| Дата: | 2019 |
|---|---|
| Автори: | , |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2019
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Репозитарії
Algebra and Discrete Mathematics| id |
oai:ojs.admjournal.luguniv.edu.ua:article-349 |
|---|---|
| record_format |
ojs |
| spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-3492019-01-24T08:21:31Z A formula for the number of weak endomorphisms on paths Knauer, Ulrich Pipattanajinda, Nirutt path, weak endomorphisms, three-dimensional square lattices 05C30; 05C38 A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths. Lugansk National Taras Shevchenko University the Research and Development Institute and the Faculty of Sciences and Technology, Kamphaeng Phet Rajabhat University, Kamphaeng Phet, Thailand. 2019-01-24 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349 Algebra and Discrete Mathematics; Vol 26, No 2 (2018) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349/pdf Copyright (c) 2019 Algebra and Discrete Mathematics |
| institution |
Algebra and Discrete Mathematics |
| baseUrl_str |
|
| datestamp_date |
2019-01-24T08:21:31Z |
| collection |
OJS |
| language |
English |
| topic |
path weak endomorphisms three-dimensional square lattices 05C30 05C38 |
| spellingShingle |
path weak endomorphisms three-dimensional square lattices 05C30 05C38 Knauer, Ulrich Pipattanajinda, Nirutt A formula for the number of weak endomorphisms on paths |
| topic_facet |
path weak endomorphisms three-dimensional square lattices 05C30 05C38 |
| format |
Article |
| author |
Knauer, Ulrich Pipattanajinda, Nirutt |
| author_facet |
Knauer, Ulrich Pipattanajinda, Nirutt |
| author_sort |
Knauer, Ulrich |
| title |
A formula for the number of weak endomorphisms on paths |
| title_short |
A formula for the number of weak endomorphisms on paths |
| title_full |
A formula for the number of weak endomorphisms on paths |
| title_fullStr |
A formula for the number of weak endomorphisms on paths |
| title_full_unstemmed |
A formula for the number of weak endomorphisms on paths |
| title_sort |
formula for the number of weak endomorphisms on paths |
| description |
A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite undirected paths. |
| publisher |
Lugansk National Taras Shevchenko University |
| publishDate |
2019 |
| url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/349 |
| work_keys_str_mv |
AT knauerulrich aformulaforthenumberofweakendomorphismsonpaths AT pipattanajindanirutt aformulaforthenumberofweakendomorphismsonpaths AT knauerulrich formulaforthenumberofweakendomorphismsonpaths AT pipattanajindanirutt formulaforthenumberofweakendomorphismsonpaths |
| first_indexed |
2025-07-17T10:35:27Z |
| last_indexed |
2025-07-17T10:35:27Z |
| _version_ |
1837890040829575168 |