A formula for the number of weak endomorphisms on paths

Скорочена інформація про документ
dc.contributor.authorKnauer, U.
dc.contributor.authorPipattanajinda, N.
dc.date.accessioned2023-02-27T16:17:21Z
dc.date.available2023-02-27T16:17:21Z
dc.date.issued2018
dc.description.abstractA 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.uk_UA
dc.description.sponsorshipThe authors would like to thank Prof. Dr. Srichan Arworn for the help and the encouragement that she provided in the preparation of this paper. The work was partially supported by the Research and Development Institute and the Faculty of Sciences and Technology, Kamphaeng Phet Rajabhat University, Kamphaeng Phet, Thailand.uk_UA
dc.identifier.citationA formula for the number of weak endomorphisms on paths / U. Knauer, N. Pipattanajinda // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 270–279. — Бібліогр.: 5 назв. — англ.uk_UA
dc.identifier.issn1726-3255
dc.identifier.other2010 MSC: 05C30; 05C38.
dc.identifier.urihttps://nasplib.isofts.kiev.ua/handle/123456789/188413
dc.language.isoenuk_UA
dc.publisherІнститут прикладної математики і механіки НАН Україниuk_UA
dc.relation.ispartofAlgebra and Discrete Mathematics
dc.statuspublished earlieruk_UA
dc.titleA formula for the number of weak endomorphisms on pathsuk_UA
dc.typeArticleuk_UA

Файли

Оригінальний контейнер

Зараз показуємо 1 - 1 з 1
Ескіз
Назва:
06-Knauer.pdf
Розмір:
385.78 KB
Формат:
Adobe Portable Document Format
Завантажити

Контейнер ліцензії

Зараз показуємо 1 - 1 з 1
Ескіз
Назва:
license.txt
Розмір:
817 B
Формат:
Item-specific license agreed upon to submission
Опис:
Завантажити

Колекція

Algebra and Discrete Mathematics, 2018, Vol. 26, № 2