2000 character limit reached
A Polynomial Time Algorithm for Graph Isomorphism (0711.2010v5)
Published 13 Nov 2007 in cs.CC
Abstract: We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two non-isomorphic graphs with the same eigenvalues.