Combinatorics Graph theory: basic notions Concept
Graph homomorphism
Summary
A graph homomorphism is a map between the vertex sets of two graphs that preserves adjacency. Homomorphisms unify colourings and other graph maps. The node graph homomorphism gives the precise definition.
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Graph_homomorphism, Definitions
About this page
| Tag | 052JJ9YVNM |
|---|---|
| URI | m2://052JJ9YVNM |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C60 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.