A Polynomial Time Algorithm for Graph Isomorphism
Computational Complexity
2022-10-18 v5
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.
Keywords
Cite
@article{arxiv.0711.2010,
title = {A Polynomial Time Algorithm for Graph Isomorphism},
author = {Reiner Czerwinski},
journal= {arXiv preprint arXiv:0711.2010},
year = {2022}
}