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.
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
