Combinatorics and Graph Theory

    

Solving Graph Isomorphism Problem in Polynomial Time

Authors: Yasunori Ohto

We show that the graph isomorphism problem is solvable in polynomial time. First, we prove the theorem to obtain the automorphisms of G using eigenvalue sets. Next, we construct an algorithm to determine whether two given graphs G_a and G_b are isomorphic using this result. The computational complexity to detect whether the two graphs are isomorphic is O(n^6).

Comments: 7 Pages.

Download: PDF

Submission history

[v1] 2024-04-23 18:54:55
[v2] 2024-05-19 07:19:54

Unique-IP document downloads: 648 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus