Abstract
An endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges. In this paper we provide an algorithm to determine the cardinalities of endomorphism monoids of finite undirected paths.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have