  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.
