Graph Isomorphism Demonstration

Two graphs are isomorphic if there is a one-to-one correspondence between their vertices that preserves adjacency. This page demonstrates three cases where graphs are not isomorphic for different reasons.

Pair 1: Different Number of Vertices

Graph A

Vertices: 4

Graph B

Vertices: 5

Pair 2: Different Degree Sequences

Graph A

Degree sequence: 3, 2, 2, 1

Graph B

Degree sequence: 2, 2, 2, 2

Pair 3: Same Degree Sequence but Different Triangle Counts

Graph A (Contains triangles)

Degree sequence: 3, 3, 3, 3, 2, 2, 2, 2

Number of triangles: 4

Graph B (No triangles)

Degree sequence: 3, 3, 3, 3, 2, 2, 2, 2

Number of triangles: 0