Certificate

PAL Definice Certifikát

Stronger variant of Graph invariant

Certificate for a family of graphs $\mathcal{F}$ is a function $\forall G_1,G_2\in \mathcal{F}:\mathrm{Cert}(G_1)=\mathrm{Cert}(G_2)⟺G_1\text{ is isomorphic to }{G}_2.$

Fastest algorithms for graphs Isomorphism use certificate