Abstract: The graph isomorphism is to find a bijection between the vertexes of two graphs that preserve the edges. This problem＇has been paid much attention by many researchers. In some papers the complexity of the graph problem has been wrong described, and polyno

Key words: Graph isomorphism, NP problem, P problem, NPC problem, Graph isomorphism complete