Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/11288| 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. | URI: | https://hdl.handle.net/10316/11288 | Rights: | openAccess |
| Appears in Collections: | FCTUC Matemática - Vários |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| The cardinality of endomorphisms of some oriented paths.pdf | 208.3 kB | Adobe PDF | View/Open |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.