An algorithm for the numbers of endomorphisms on paths (DM13208)
An endomorphism of a graph is a mapping on the vertex set of the graph which preserves edges. In this paper we provide an algorithm to determine the cardinalities of endomorphism monoids of finite undirected paths. © 2008 Elsevier B.V. All rights reserved.
Saved in:
| Main Author: | |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=56349146146&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/49254 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
Be the first to leave a comment!