Formulas for the Number of Weak Homomorphisms from Paths to Rectangular Grid Graphs
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.