Combinatorics Graph theory: basic notions Concept
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.
Where this leads
5 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Graph_isomorphism, lead section
About this page
| Tag | 0F7QKGJS6B |
|---|---|
| URI | m2://0F7QKGJS6B |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C60 |
| Specializes | Graph homomorphism |
| 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.