An algorithm for the number of path homomorphisms
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 u...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Journal |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=69549138417&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/59734 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Chiang Mai University |
| id |
th-cmuir.6653943832-59734 |
|---|---|
| record_format |
dspace |
| spelling |
th-cmuir.6653943832-597342018-09-10T03:20:37Z An algorithm for the number of path homomorphisms Srichan Arworn Piotr Wojtylak Mathematics 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. 2018-09-10T03:20:37Z 2018-09-10T03:20:37Z 2009-09-28 Journal 0012365X 2-s2.0-69549138417 10.1016/j.disc.2008.04.010 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=69549138417&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/59734 |
| institution |
Chiang Mai University |
| building |
Chiang Mai University Library |
| country |
Thailand |
| collection |
CMU Intellectual Repository |
| topic |
Mathematics |
| spellingShingle |
Mathematics Srichan Arworn Piotr Wojtylak An algorithm for the number of path homomorphisms |
| description |
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. |
| format |
Journal |
| author |
Srichan Arworn Piotr Wojtylak |
| author_facet |
Srichan Arworn Piotr Wojtylak |
| author_sort |
Srichan Arworn |
| title |
An algorithm for the number of path homomorphisms |
| title_short |
An algorithm for the number of path homomorphisms |
| title_full |
An algorithm for the number of path homomorphisms |
| title_fullStr |
An algorithm for the number of path homomorphisms |
| title_full_unstemmed |
An algorithm for the number of path homomorphisms |
| title_sort |
algorithm for the number of path homomorphisms |
| publishDate |
2018 |
| url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=69549138417&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/59734 |
| _version_ |
1681425306190086144 |