The cardinality of endomorphisms of some oriented paths: an algorithm

• Autor(es): Arworn, Sr. ; Fonseca, C. M. da ; Saenpholphat, V.
• Data: 2007
• Identificador Persistente: http://hdl.handle.net/10316/11288
• Origem: Estudo Geral - Universidade de Coimbra
• Assunto(s): Simple path; Oriented path; Graph endomorphism; Square lattice
• Tipo de Documento: Preprint
• Idioma: Inglês

Descrição

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 ( nite) directed paths, based on results on simple paths. Chiang Mai University; CMUC - Centro de Matemática da Universidade de Coimbra; Srinakharinwirot University; Thailand Research Fund and Commission on Higher Education, Thailand MRG5080075