# Graph isomorphism

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Graph isomorphism](https://ocme.evemisslab.com/en/atlas/atlas-graph-isomorphism/)

An isomorphism of finite simple graphs is a vertex bijection preserving both adjacency and nonadjacency for every pair.

atlas-graph-isomorphism · canonical_mko

[Graph isomorphism](https://ocme.evemisslab.com/en/mko/mko-graph-isomorphism/)

## Prerequisite nodes


- [Finite simple undirected graphs](https://ocme.evemisslab.com/en/atlas/atlas-graph/)
- [Bijectivity and unique preimages](https://ocme.evemisslab.com/en/atlas/atlas-bijective/)
- [Binary relations and set projections](https://ocme.evemisslab.com/en/atlas/atlas-relation/)