A weak homomorphism from graph G to graph H is a mapping f : V (G) → V (H) , where either f (x) = f (y) or { f (x) , f (y) } ∈ E (H) hold for all { x , y } ∈ E (G) . A rectangular grid graph is formed by taking the Cartesian product of two paths. Counting weak homomorphisms is a fundamental problem in graph theory. In this paper, we present formulas for calculating the number of weak homomorphisms from paths to rectangular grid graphs. This count directly corresponds to the number of partial walks with length m within the rectangular grid graph, offering a combinatorial solution to this enumeration problem. [ABSTRACT FROM AUTHOR]

Copyright of Symmetry (20738994) is the property of MDPI and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)