Finding the Number of Weak Homomorphisms of Paths
Let G and H be graphs. A mapping f from VG to VH is called a weak homomorphism from G to H if fx=fy or fx,fy∈EH whenever x,y∈EG. In this paper, we provide an algorithm to determine the number of weak homomorphisms of paths.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2022/2153927 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|