Please use this identifier to cite or link to this item: http://hdl.handle.net/10316/11288
DC FieldValueLanguage
dc.contributor.authorArworn, Sr.-
dc.contributor.authorFonseca, C. M. da-
dc.contributor.authorSaenpholphat, V.-
dc.date.accessioned2009-09-07T09:07:18Z-
dc.date.available2009-09-07T09:07:18Z-
dc.date.issued2007-
dc.identifier.citationPré-Publicações DMUC. 07-30 (2007)en_US
dc.identifier.urihttp://hdl.handle.net/10316/11288-
dc.description.abstractAn 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.en_US
dc.description.sponsorshipChiang Mai University; CMUC - Centro de Matemática da Universidade de Coimbra; Srinakharinwirot University; Thailand Research Fund and Commission on Higher Education, Thailand MRG5080075en_US
dc.language.isoengen_US
dc.publisherCentro de Matemática da Universidade de Coimbraen_US
dc.rightsopenAccesseng
dc.subjectSimple pathen_US
dc.subjectOriented pathen_US
dc.subjectGraph endomorphismen_US
dc.subjectSquare latticeen_US
dc.titleThe cardinality of endomorphisms of some oriented paths: an algorithmen_US
dc.typepreprinten_US
item.languageiso639-1en-
item.fulltextCom Texto completo-
item.grantfulltextopen-
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 simple item record

Page view(s)

57
checked on Aug 19, 2019

Download(s) 50

178
checked on Aug 19, 2019

Google ScholarTM

Check


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