Formulas for the Number of Weak Homomorphisms from Paths to Ladder Graphs and Stacked Prism Graphs

Hatairat Yingtaweesittikul, Sayan Panma, Penying Rochanakul and Serkan Araci

Journal of Mathematics, 2023, vol. 2023, 1-13

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. A ladder graph is the Cartesian product of two paths, where one of the paths has only one edge. A stacked prism graph is the Cartesian product of a path and a cycle. In this paper, we provide a formula to determine the number of weak homomorphisms from paths to ladder graphs and a formula to determine the number of weak homomorphisms from paths to stacked prism graphs.

Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2023/1159532.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2023/1159532.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:1159532

DOI: 10.1155/2023/1159532

Access Statistics for this article

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