Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/59748
Title: An algorithm for the numbers of endomorphisms on paths (DM13208)
Authors: Sr Arworn
Authors: Sr Arworn
Keywords: Mathematics
Issue Date: 6-Jan-2009
Abstract: 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.
URI: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=56349146146&origin=inward
http://cmuir.cmu.ac.th/jspui/handle/6653943832/59748
ISSN: 0012365X
Appears in Collections:CMUL: Journal Articles

Files in This Item:
There are no files associated with this item.


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