Finding the Number of Weak Homomorphisms of Paths

Tawatchai Pomsri, Wannasiri Wannasit, Sayan Panma and A. Ghareeb

Journal of Mathematics, 2022, vol. 2022, 1-4

Abstract: 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.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/2153927.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/2153927.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:2153927

DOI: 10.1155/2022/2153927

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().