Try this exercise. Fill in the missing part by typing it in.

Graph isomorphism is a topic in graph theory that deals with determining whether two graphs are ___, i.e., whether they have the same structure.

A graph isomorphism is a one-to-one mapping between the _ of two graphs that preserves the edge structure.

Determining graph isomorphism is a challenging problem and is often studied in the context of algorithm design and complexity theory.

There are various algorithms to check for graph isomorphism, including the __, the ____, and the _ algorithm.