An example usage of this notion is that any two cores of a graph are homomorphically equivalent.
Deciding whether two graphs are homomorphically equivalent is NP-complete.
[1] In fact for any category C, one can define homomorphic equivalence.
It is used in the theory of accessible categories, where "weak universality" is the best one can hope for in terms of injectivity classes; see [2]
This graph theory-related article is a stub.