A Polynomial Time Algorithm for Graph Isomorphism

Reiner Czerwinski
Arxiv ID: 0711.2010Last updated: 10/18/2022
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.

PaperStudio AI Chat

I'm your research assistant! Ask me anything about this paper.
Commercial Disclosure
© 2023 Paper Studio™. All Rights Reserved.