Homomorphic equivalence
In the mathematics of graph theory, two graphs, G and H, are called homomorphically equivalent if there exists a graph homomorphism [math]\displaystyle{ f\colon G\to H }[/math] and a graph homomorphism [math]\displaystyle{ g\colon H\to G }[/math]. An example usage of this notion is that any two cores of a graph are homomorphically equivalent.
Homomorphic equivalence also comes up in the theory of databases. Given a database schema, two instances I and J on it are called homomorphically equivalent if there exists an instance homomorphism [math]\displaystyle{ f\colon I\to J }[/math] and an instance homomorphism [math]\displaystyle{ g\colon J\to I }[/math].
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]
References
- ↑ Flum, J.; Grohe, M. (2006-05-01). Parameterized Complexity Theory. Springer Science & Business Media. p. 330. ISBN 978-3-540-29953-0.
- ↑ Adamek and Rosicky, "Locally Presentable and Accessible Categories".
 |  |
