Graph isomorphism
Summary
A graph isomorphism is a bijection between the vertices of two graphs that preserves and reflects adjacency. Isomorphic graphs have the same structure and differ only in the names of their vertices. The node graph isomorphism 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
- Web https://en.wikipedia.org/wiki/Graph_isomorphism, lead section
What links here
Definitions
- Graph isomorphism 00CT0PTH74