Testing Isomorphism of Graphs in Polynomial Time

Rui Xue

Given a graph $G$, the graph $[G]$ obtained by adding, for each pair of vertices of $G$, a unique vertex adjacent to both vertices is called the binding graph of $G$. In this work,…