Scribd
Upload
14 views

s9.3 Graph Isomorphism

Graph isomorphism refers to the condition where two simple graphs are isomorphic if there exists a bijective function between their vertices that preserves adjacency. Key invariants for determining isomorphism include having the same number of vertices, edges, and vertex degrees. The document provides examples of both isomorphic and non-isomorphic graphs to illustrate these concepts.

Uploaded by

6yzdahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

s9.3 Graph Isomorphism

Graph isomorphism refers to the condition where two simple graphs are isomorphic if there exists a bijective function between their vertices that preserves adjacency. Key invariants for determining isomorphism include having the same number of vertices, edges, and vertex degrees. The document provides examples of both isomorphic and non-isomorphic graphs to illustrate these concepts.

Uploaded by

6yzdahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Graph Isomorphism

Discrete Mathematics

Graph Isomorphism 1
Definition: Isomorphism of Graphs

Definition
The simple graphs G1 = (V1 , E1 ) and G2 = (V2 , E2 ) are
isomorphic if there is an injective (one-to-one) and surjective
(onto) function f from V1 to V2 with the property that a and b
are adjacent in G1 if and only if f (a) and f (b) are adjacent in G2 ,
for all a and b in V1 . Such a function f is called an isomorphism.

In other words, when two simple graphs are isomorphic, there is a


bijection (one-to-one correspondence) between vertices of the two
graphs that preserves the adjacency relationship.

Graph Isomorphism 2
Example of Isomorphic Graphs

u2 v1

v5 v2
u1 u3

u5 u4 v4 v3
G H

f (u1 ) = v1 , f (u2 ) = v3 , f (u3 ) = v5 , f (u4 ) = v2 and f (u5 ) = v4 .

Graph Isomorphism 3
Example of Isomorphic Graphs

G u1 u2 u3 u4 u5 H v1 v2 v3 v4 v5
u1 0 1 0 0 1 v1 0 0 1 1 0
u2 1 0 1 0 0 v2 0 0 0 1 1
u3 0 1 0 1 0 v3 1 0 0 0 1
u4 0 0 1 0 1 v4 1 1 0 0 0
u5 1 0 0 1 0 v5 0 1 1 0 0
G u1 u2 u3 u4 u5 H v1 v3 v5 v2 v4
u1 0 1 0 0 1 v1 0 1 0 0 1
u2 1 0 1 0 0 v3 1 0 1 0 0
u3 0 1 0 1 0 v5 0 1 0 1 0
u4 0 0 1 0 1 v2 0 0 1 0 1
u5 1 0 0 1 0 v4 1 0 0 1 0

Graph Isomorphism 4
Isomorphic Graph’s Invariant

We can tell if two graphs are invariant or not using graphs


invariant. For example, two simple isomorphic graphs must :
have the same number of vertices,
have the same number of edges,
have the same degrees of vertices.
Note 1: These conditions are necessary but not sufficient to show
that two graphs are isomorphics.
Note 2: The breaking of one of these conditions is sufficient but
not necessary to show that two graphs are not isomorphic.

Graph Isomorphism 5
Example of Non-Isomorphic Graphs

u2 v1

u1 u3 v5 v2

u5 u4 v4 v3

Graph Isomorphism 6
Are These Graphs Isomorphic?

u1 u2 v1 v2

v5 v3

u5 u4 u3 v4
G H

Graph Isomorphism 7
Are These Graphs Isomorphic?

u1 u2 v1 v2

v5 v3

u5 u4 u3 v4
G H

f (u3 ) = v2 , f (u4 ) = v3 , f (u2 ) = v5 , f (u5 ) = v4 and f (u1 ) = v1 .

Graph Isomorphism 8
These Two Graphs Are Isomorphic

u1 u2 v1 v2

v5 v3

u5 u4 u3 v4
G H
G u1 u2 u3 u4 u5 H v1 v5 v2 v3 v4
u1 0 1 0 1 1 v1 0 1 0 1 1
u2 1 0 1 1 1 v5 1 0 1 1 1
u3 0 1 0 1 0 v2 0 1 0 1 0
u4 1 1 1 0 1 v3 1 1 1 0 1
u5 1 1 0 1 0 v4 1 1 0 1 0

Graph Isomorphism 9

You might also like