Definition:Homomorphism (Graph Theory)

Definition
Let $G = \left({V \left({G}\right), E \left({G}\right)}\right)$ and $H = \left({V \left({H}\right), E \left({H}\right)}\right)$ be graphs.

Let there exist a mapping $F: V \left({G}\right) \to V \left({H}\right)$ such that:
 * for each edge $\left\{{u, v}\right\} \in E \left({G}\right)$
 * there exists an edge $\left\{{F \left({u}\right), F \left({v}\right)}\right\} \in E \left({H}\right)$.

Then $G$ and $H$ are homomorphic.

The mapping $F$ is called a homomorphism from $G$ to $H$.