Graph theory MOC Graph homomorphism Let be general graphs. A graph homomorphism is a function which “almost preserves” the adjacency matrix, 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 Category of general graphs. develop | en | sembr