Graph isomorphism problem

The Graph Isomorphism problem is a well-studied problem in the field of graph theory and computer science. It concerns the question of whether two given graphs are isomorphic, meaning there is a one-to-one correspondence between their vertices that preserves the adjacency relations.