Scribd
Upload
6 views13 pages

Isomorphic Graphs

Uploaded by

soham.parikh23
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
6 views13 pages

Isomorphic Graphs

Uploaded by

soham.parikh23
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/ 13

Isomorphic Graphs

Each distinct vertex of graph G should be mapped to each


distinct vertex of Graph H.
Every vertex in graph H, should get mapped to some
vertex in graph G.
Function Ჶ is called isomorphism.
For any two graphs to be isomorphic, following 4 conditions must be satisfied-

● Number of vertices in both the graphs must be same.

● Number of edges in both the graphs must be same.

● Degree sequence of both the graphs must be same.

● If a cycle of length k is formed by the vertices { v1 , v2 , ….. , vk } in

one graph, then a cycle of same length k must be formed by the

vertices { f(v1) , f(v2) , ….. , f(vk) } in the other graph as well.


Some facts
● Two graphs are isomorphic if and only if their complement graphs are

isomorphic.

● Two graphs are isomorphic if their adjacency matrices are same.

● Two graphs are isomorphic if their corresponding sub-graphs obtained by

deleting some vertices of one graph and their corresponding images in the

other graph are isomorphic.


G3 is neither isomorphic to G1 nor G2.

Graphs G1 and G2 are isomorphic graphs.

You might also like