Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/59748Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Sr Arworn | en_US |
| dc.date.accessioned | 2018-09-10T03:20:54Z | - |
| dc.date.available | 2018-09-10T03:20:54Z | - |
| dc.date.issued | 2009-01-06 | en_US |
| dc.identifier.issn | 0012365X | en_US |
| dc.identifier.other | 2-s2.0-56349146146 | en_US |
| dc.identifier.other | 10.1016/j.disc.2007.12.049 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=56349146146&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/59748 | - |
| dc.description.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. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | An algorithm for the numbers of endomorphisms on paths (DM13208) | en_US |
| dc.type | Journal | en_US |
| article.title.sourcetitle | Discrete Mathematics | en_US |
| article.volume | 309 | en_US |
| article.stream.affiliations | Chiang Mai University | en_US |
| 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.