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
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