Formulas for the Number of Weak Homomorphisms from Paths to Rectangular Grid Graphs
Combinatorics
2023-12-21 v1
Abstract
A weak homomorphism from a graph G to a graph H is a mapping f from V(G) to V(H), where either f(x) = f(y) or {f(x), f(y)} is an element of E(H), and this holds for all {x, y} in E(G). A rectangular grid graph is formed by taking the Cartesian product of two paths. In this paper, we present a formula for calculating the number of weak homomorphisms from paths to rectangular grid graphs.
Keywords
Cite
@article{arxiv.2312.13089,
title = {Formulas for the Number of Weak Homomorphisms from Paths to Rectangular Grid Graphs},
author = {Penying Rochanakul and Hatairat Yingtaweesittikul and Sayan Panma},
journal= {arXiv preprint arXiv:2312.13089},
year = {2023}
}
Comments
21 pages