Наукова електронна бібліотека
періодичних видань НАН України
періодичних видань НАН України
A formula for the number of weak endomorphisms on paths
Репозиторій DSpace/Manakin
JavaScript is disabled for your browser. Some features of this site may not work without it.
A formula for the number of weak endomorphisms on paths
Інший ID:
2010 MSC: 05C30; 05C38.
Посилання:
A formula for the number of weak endomorphisms on paths / U. Knauer, N. Pipattanajinda // Algebra and Discrete Mathematics. — 2018. — Vol. 26, № 2. — С. 270–279. — Бібліогр.: 5 назв. — англ.
Підтримка:
The 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.
Дата:
2018
Переглядів:
245
Завантажень:
85
Анотація:
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.
