 Graph homomorphism

A graph homomorphism from $H$ to $G$ is a function $f:V(H)\to V(G)$ that sends every edge $uv$ of $H$ to an edge $f(u)f(v)$ of $G$.

Graph homomorphism is a mathematical concept from graph theory that deals with the relationship between two graphs.