Affiliation:
1. Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
Abstract
Let G and H be graphs. A mapping f from the vertices of G to the vertices of H is known as a homomorphism from G to H if, for every pair of adjacent vertices x and y in G, the vertices f(x) and f(y) are adjacent in H. A rectangular grid graph is the Cartesian product of two path graphs. In this paper, we provide a formula to determine the number of homomorphisms from paths to rectangular grid graphs. This formula gives the solution to the problem concerning the number of walks in the rectangular grid graphs.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference10 articles.
1. Hell, P., and Nestril, J. (2004). Graphs and Homomorphisms, Oxford University Press.
2. Knauer, U., and Knauer, K. (2011). Algebraic Graph Theory: Morphisms, Monoids and Matrices, Walter de Gruyter.
3. An algorithm for the numbers of endomorphisms on paths;Arworn;Discret. Math.,2009
4. An algorithm for the number of path homomorphisms;Arworn;Discret. Math.,2009
5. On the number of congruence classes of paths;Lina;Discret. Math.,2012