Isomorphism of graphs-a polynomial test

TL;DR

This paper introduces a polynomial-time algorithm for testing graph isomorphism, providing an explicit method and proof of its correctness, which advances the computational approach to this classical problem.

Contribution

The paper presents a new explicit polynomial-time algorithm for testing graph isomorphism, with a proof of correctness and efficiency.

Findings

Algorithm operates in polynomial time for graphs of size n

Explicit steps for isomorphism testing are provided

Proof confirms the algorithm's correctness

Abstract

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that the algorithm actually performs the test is presented.