Carlos Fonseca; Sr. Arworn; V. Saenpholphat;
The cardinality of endomorphisms of some oriented paths: an algorithm
An endomorphism of a (oriented) graph is a mapping on the vertex set preserving (arcs) edges. In this paper we provide an algorithm to determine the cardinalities of endomorphism monoids of some (finite) directed paths, based on results on simple paths.
Pré-publicações do Departamento de Matemática da Universidade de Coimbra