Scribd
Upload
49 views12 pages

Isomorphism of Graphs: Dr. P.S.R. Murty

Two graphs G1 and G2 are isomorphic if there exists a one-to-one and onto function f between their vertices that preserves edges. Specifically, f maps each vertex in G1 to a vertex in G2 such that two vertices u and v in G1 are adjacent if and only if f(u) and f(v) are adjacent in G2. Two graphs are also isomorphic if they have the same number of vertices and edges, same vertex degrees, and the same degree sequence and adjacency matrix.

Uploaded by

sai
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
49 views12 pages

Isomorphism of Graphs: Dr. P.S.R. Murty

Two graphs G1 and G2 are isomorphic if there exists a one-to-one and onto function f between their vertices that preserves edges. Specifically, f maps each vertex in G1 to a vertex in G2 such that two vertices u and v in G1 are adjacent if and only if f(u) and f(v) are adjacent in G2. Two graphs are also isomorphic if they have the same number of vertices and edges, same vertex degrees, and the same degree sequence and adjacency matrix.

Uploaded by

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

Isomorphism of graphs

Dr. P.S.R. MURTY


1
1

Two graphs G1 & G2 are said to be isomorphic to


each other if there exists a function f from the
vertices of G1 to the vertices of G2 i.e.
f: V(G1)—›V(G2), such that
 f is one-one
 f is onto
 for each pair of vertices u, v in G1 there exists a
corresponding pair of vertices f(u),f(v) in G2 such
that {u,v} Є E(G1) if and only if {f(u),f(v)} Є E(G2).
Any function f with the above three conditions is
called an isomorphism from G1 to G2.
NOTE: The condition (3) states that u and v are
adjacent in G1 iff f(u) & f(v) are adjacent in G2.
TEST FOR ISOMORPHISM
Two graphs G1 and G2 are said to be isomorphic to each
other if

1) They have same number of vertices.

2) They have same number of edges.

3) They have equal no. of vertices with same degree.

4) They have same degree sequence.

5) They have same adjacency matrix.


Determine whether the two graphs are isomorphic or
not?

Sol: 1) No. of vertices in both the graphs = 6.


2) No. of edges in both the graphs = 5.
3) No. of first degree vertices in both the graphs = 3.
No. of second degree vertices in both the graphs = 2.
No. of third degree vertices in both the graphs = 1.
There is no isomorphism from G1 to G2.
Determine whether the two graphs are isomorphic or
not?

Sol: 1) No. of vertices in both the graphs = 5.


2) No. of edges in G1 = 8.
No. of edges in G2= 7.
There is no isomorphism from G1 to G2.
Prove that the two graphs are isomorphic to each
other

Sol: 1) No. of vertices in both the graphs = 4.


2) No. of edges in both the graphs = 4.
3) No. of second degree vertices in both the graphs = 4.
4)Define f: G1 to G2 as f(v1) = u1, f(v2) = u2, f(v3) = u3,
f(v4) = u4.
Degree sequence of G1 = (v1,v2,v3.v4) = (2,2,2,2)
Degree sequence of G2 = (u1,u2,u3,u4) = (2,2,2,2)
Hence, degree sequence of both the graphs is same.
Since the adjacency matrices of both the graphs are
also same ‘f’ is an isomorphism from G1 to G2.
Adjacency matrix of G1 Adjacency matrix of G2
v1 v2 v3 v4 u1 u2 u3 u4
v1 0 1 1 0 u1 0 1 1 0
v2 1 0 0 1 u2 1 0 0 1
v3 1 0 0 1 u3 1 0 0 1
v4 0 1 1 0 u4 0 1 1 0
Prove that the two graphs are isomorphic to each other

Sol: 1) No. of vertices in both the graphs = 5.


2) No. of edges in both the graphs = 6.
3) No. of first degree vertices in both the graphs = 1.
No. of second degree vertices in both the graphs = 1.
No. of third degree vertices in both the graphs = 3.
Degrees of the adjacent vertices of each vertex in G1 and G2
are
In the graph G1: In the graph G2:
1

Define f: G1 to G2 as f(u5) = v5, f(u2) = v4, f(u3) = v2,


f(u1) = v1, f(u4)=v3.
Degree sequence of G1 = (u1,u2,u3,u4,u5) = (3,3,2,3,1)
Degree sequence of G2 = (v1,v4,v2,v3,v5) = (3,3,2,3,1)
Hence, degree sequence of both the graphs is same.
Since the adjacency matrices of both the graphs are also
same ‘f’ is an isomorphism from G1 to G2.
Determine whether the two graphs are isomorphic or
not?
THANK YOU

12

You might also like