A formula for the number of weak endomorphisms on paths

dc.contributor.author	Knauer, U.
dc.contributor.author	Pipattanajinda, N.
dc.date.accessioned	2023-02-27T16:17:21Z
dc.date.available	2023-02-27T16:17:21Z
dc.date.issued	2018
dc.identifier.citation	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 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2010 MSC: 05C30; 05C38.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/188413
dc.description.abstract	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.	uk_UA
dc.description.sponsorship	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.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	A formula for the number of weak endomorphisms on paths	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA