Please use this identifier to cite or link to this item:
Title: The cardinality of endomorphisms of some oriented paths: an algorithm
Authors: Arworn, Sr. 
Fonseca, C. M. da 
Saenpholphat, V. 
Keywords: Simple path; Oriented path; Graph endomorphism; Square lattice
Issue Date: 2007
Publisher: Centro de Matemática da Universidade de Coimbra
Citation: Pré-Publicações DMUC. 07-30 (2007)
Abstract: 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.
Rights: openAccess
Appears in Collections:FCTUC Matemática - Vários

Files in This Item:
File Description SizeFormat
The cardinality of endomorphisms of some oriented paths.pdf208.3 kBAdobe PDFView/Open
Show full item record

Page view(s)

checked on Aug 4, 2022


checked on Aug 4, 2022

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.