A canonical labeling, also called a canonical form, of a graph G is a graph G' which is isomorphic to G and which represents the whole isomorphism class of G. The complexity class of canonical labeling is not known. Efficient labeling methods yield an efficient tests for isomorphic graphs, as provided for example by nauty, Traces, bliss, and other software implementations.

isomorphic graphs