# A polynomial-time algorithm for simple undirected graph isomorphism

2019-08-19

Journal Article

Concurrency Computat Pract Exper.

2019

8

24

The graph isomorphism problem is to determine two finite graphs that are isomorphic which is not known with a polynomial-time solution. This paper solves the simple undirected graph isomorphism problem with an algorithmic approach as NP=P and proposes a polynomial-time solution to check if two simple undirected graphs are isomorphic or not. Three new representation methods of a graph as vertex/edge adjacency matrix and triple tuple are proposed. A duality of edge and vertex and a reflexivity between vertex adjacency matrix and edge adjacency matrix were first introduced to present the core idea. Beyond this, the mathematical approval is based on an equivalence between permutation and bijection. Because only addition and multiplication operations satisfy the commutative law, we propose a permutation theorem to check fast whether one of two sets of arrays is a permutation of another or not. The permutation theorem was mathematically approved by Integer Factorization Theory, Pythagorean Triples Theorem, and Fundamental Theorem of Arithmetic. For each of two n-ary arrays, the linear and squared sums of elements were respectively calculated to produce the results.

Wiley

equivalence between permutation and bijection, graph isomorphism, polynomial-time solution, reflexivity and duality, simple undirected graph, vertex/edge adjacency matrix

Mathematical Economics ; Concurrent Programming

EP195982

Journal article - Refereed

English

He, Jing; Chen, Jinjun; Huang, Guangyan; Cao, Jie; Zhang, Zhiwang; Zhang, Peng; Zheng, Hui; Zarei, Roozbeh; Susanto, Ferry; Wang, Ruchuan; Ji, Yimu; Fan, Weibei; Xie, Zhijun; Wang, Xiancheng; Guo, Mengjiao; Chi, Chi-Hung; De Souza Junior, Paulo; Zhang, Jiekui; Li, Youtao; Chen, Xiaojun; Shi, Yong; Green, David; Taraporewalla, Kersi; van Zundert, André. A polynomial-time algorithm for simple undirected graph isomorphism. Concurrency Computat Pract Exper.. 2019; 2019(8):24. http://hdl.handle.net/102.100.100/366048?index=1

Loading citation data...

Citation counts

(Requires subscription to view)