Homomorphic equivalence
Summary
In graph theory, a branch of mathematics, two graphs G and H are called homomorphically equivalent if there exists a graph homomorphism and a graph homomorphism . An example usage of this notion is that any two cores of a graph are homomorphically equivalent.
Further reading
- Wikipedia, page 51231053, revision 1240292381, Homomorphic equivalence. adopted
About this page
| Tag | 70XS2M1FWW |
|---|---|
| URI | m2://70XS2M1FWW |
| Aliases | homomorphically-equivalent |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.