Combinatorial invariants for graph isomorphism problem

Jarek Duda

Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For exa…