An Algorithm for the Numbers of Homomorphisms from Paths to Rectangular Grid Graphs

An Algorithm for the Numbers of Homomorphisms from Paths to Rectangular Grid Graphs

Let <i>G</i> and <i>H</i> be graphs. A mapping <i>f</i> from the vertices of <i>G</i> to the vertices of <i>H</i> is known as a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"&g...

Full description

Bibliographic Details
Main Authors: Hatairat Yingtaweesittikul, Sayan Panma, Penying Rochanakul
Format: Article
Language:English
Published: MDPI AG 2023-06-01
Series:Mathematics
Subjects:
homomorphisms
graph homomorphisms
path graphs
rectangular grid graphs
grid graphs
Online Access:https://www.mdpi.com/2227-7390/11/11/2587

Internet

https://www.mdpi.com/2227-7390/11/11/2587

Similar Items