Graph isomorphism problem

Unsolved problem in computational complexity theory
Abstract

The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic.

Wikipedia