Please use this identifier to cite or link to this item:
http://cmuir.cmu.ac.th/jspui/handle/6653943832/59734Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Srichan Arworn | en_US |
| dc.contributor.author | Piotr Wojtylak | en_US |
| dc.date.accessioned | 2018-09-10T03:20:37Z | - |
| dc.date.available | 2018-09-10T03:20:37Z | - |
| dc.date.issued | 2009-09-28 | en_US |
| dc.identifier.issn | 0012365X | en_US |
| dc.identifier.other | 2-s2.0-69549138417 | en_US |
| dc.identifier.other | 10.1016/j.disc.2008.04.010 | en_US |
| dc.identifier.uri | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=69549138417&origin=inward | en_US |
| dc.identifier.uri | http://cmuir.cmu.ac.th/jspui/handle/6653943832/59734 | - |
| dc.description.abstract | A homomorphism of a graph G1= (V1, E1) to a graph G2= (V2, E2) is a mapping from the vertex set V1of G1to the vertex set V2of G2which preserves edges. In this paper we provide an algorithm to determine the number of homomorphisms from an arbitrary finite undirected path to another arbitrary finite undirected path. © 2008 Elsevier B.V. All rights reserved. | en_US |
| dc.subject | Mathematics | en_US |
| dc.title | An algorithm for the number of path homomorphisms | 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 |
| article.stream.affiliations | University of Silesia in Katowice | 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.