A Polynomial Time Algorithm for Graph Isomorphism
Reiner Czerwinski · arXiv (Cornell University) · 2007
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.