A formula for the number of weak endomorphisms on paths

dc.contributor.author	Knauer, U.
dc.contributor.author	Pipattanajinda, N.
dc.date.accessioned	2019-12-17T08:34:01Z
dc.date.available	2019-12-17T08:34:01Z
dc.date.issued	2018
dc.identifier.uri	http://hdl.handle.net/123456789/4547
dc.description	Knauer U. A formula for the number of weak endomorphisms on paths / U. Knauer, N . Pipattanajinda // Algebra and Discrete Mathematics. - 2018. - Vol. 26. - Number 2. - Рp. 270-279	uk_UA
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.language.iso	en	uk_UA
dc.publisher	ДЗ "ЛНУ імені Тараса Шевченка"	uk_UA
dc.relation.ispartofseries	математичні науки;
dc.subject	path	uk_UA
dc.subject	weak endomorphisms	uk_UA
dc.subject	three-dimensional square lattices	uk_UA
dc.title	A formula for the number of weak endomorphisms on paths	uk_UA
dc.type	Article	uk_UA