Math 2.0

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.

What this node 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)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Graph_homomorphism, Definitions

What links here

Definitions