Let be general graphs.
A graph homomorphism is a function which “almost preserves” the adjacency matrix, #m/def/graph i.e.
where if the inequality is made an equality is a full graph homomorphism.
The terms graph isomorphism, graph endomorphism, and graph automorphism are then defined accordingly,
and we have the .