Polynomial algorithm for graph isomorphism problem.

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 example numbers of closed paths of length k for given starting vertex, what can be though as the diagonal terms of k-th power of the adjacency matrix. For k = 2 we would get degree of verities invariant, higher describes local topology deeper. Now if two graphs are isomorphic, they have the same set of such vectors of invariants- we can sort theses vectors lexicographically and compare them. If they agree, permutations from sorting allow to reconstruct the isomorphism. I’m presenting arguments that these invariants should fully determine the graph, but unfortunately I can’t prove it in this moment. This approach can give hope, that maybe P=NP-instead of checking all instances, we should make arithmetics on these large numbers

Polynomial algorithm for graph isomorphism problem.

Presented algorithm instead of checking exponential number of possibilities, only makes arithmetics on these large numbers. It will construct in polynomial time n 2 invariants, which has to agree for isomorphic graphs. These invariants are numbers of closed paths of length k for given starting vertex, what can be though as diagonal terms of k-th power of the adjacency matrix. For k = 2 we would get degree of verities invariant, higher describes local topology deeper. We can quickly compare these invariants by just sorting them to get the isomorphism. I’ll present also some arguments that these invariants for k = 1,..,n should uniquely determine the graph, so using them we should decide in polynomial time if graphs are isomorphic. This approach can give hope, that maybe P=NP