### Abstract

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.

Original language | English |
---|---|

Article number | e5484 |

Number of pages | 24 |

Journal | Concurrency and Computation-Practice & Experience |

DOIs | |

Publication status | Accepted/In press - 16 Aug 2019 |

### Keywords

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

### Cite this

*Concurrency and Computation-Practice & Experience*, [e5484]. https://doi.org/10.1002/cpe.5484

}

*Concurrency and Computation-Practice & Experience*. https://doi.org/10.1002/cpe.5484

**A polynomial-time algorithm for simple undirected graph isomorphism.** / He, Jing; Chen, Jinjun; Huang, Guangyan; Cao, Jie; Zhang, Zhiwang; Zheng, Hui; Zhang, Peng; Zarei, Roozbeh; Sansoto, Ferry; Wang, Ruchuan; Ji, Yimu; Fan, Weibei; Xie, Zhijun; Wang, Xiancheng; Guo, Mengjiao; Chi, Chi Hung; de Souza, Paulo A.; Zhang, Jiekui; Li, Youtao; Chen, Xiaojun; Shi, Yong; Green, David; Kersi, Taraporewalla; Van Zundert, André.

Research output: Contribution to journal › Article › Research › peer-review

TY - JOUR

T1 - A polynomial-time algorithm for simple undirected graph isomorphism

AU - He, Jing

AU - Chen, Jinjun

AU - Huang, Guangyan

AU - Cao, Jie

AU - Zhang, Zhiwang

AU - Zheng, Hui

AU - Zhang, Peng

AU - Zarei, Roozbeh

AU - Sansoto, Ferry

AU - Wang, Ruchuan

AU - Ji, Yimu

AU - Fan, Weibei

AU - Xie, Zhijun

AU - Wang, Xiancheng

AU - Guo, Mengjiao

AU - Chi, Chi Hung

AU - de Souza, Paulo A.

AU - Zhang, Jiekui

AU - Li, Youtao

AU - Chen, Xiaojun

AU - Shi, Yong

AU - Green, David

AU - Kersi, Taraporewalla

AU - Van Zundert, André

PY - 2019/8/16

Y1 - 2019/8/16

N2 - 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.

AB - 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.

KW - equivalence between permutation and bijection

KW - graph isomorphism

KW - polynomial-time solution

KW - reflexivity and duality

KW - simple undirected graph

KW - vertex/edge adjacency matrix

UR - http://www.scopus.com/inward/record.url?scp=85070780482&partnerID=8YFLogxK

U2 - 10.1002/cpe.5484

DO - 10.1002/cpe.5484

M3 - Article

AN - SCOPUS:85070780482

JO - Concurrency and Computation-Practice & Experience

JF - Concurrency and Computation-Practice & Experience

SN - 1532-0626

M1 - e5484

ER -