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 ( nite) directed paths, based on results on simple paths.
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | other |
| Language: | eng |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10316/11288 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/11288 |