 Graph isomorphism

Two graphs are isomorphic when a bijection between their vertex sets preserves adjacency.

Graph isomorphism is a concept in graph theory that describes a relationship between two graphs. Two graphs \( G_1 \) and \( G_2 \) are said to be **isomorphic** if there exists a one-to-one correspondence (a bijection) between their vertex sets such that the adjacency relationships are preserved.