If graph isomorphism is NP-complete, the polynomial time hierarchy collapses to its second level.
What finite hierarchy implies that the graph isomorphism problem is NP-complete? 
polynomial time hierarchy