Scribd
Upload
7 views15 pages

Graphs

Graph theory

Uploaded by

Faisal Khan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
7 views15 pages

Graphs

Graph theory

Uploaded by

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

Isomorphism of Graphs

Definition: The simple graphs G1 = (V1, E1) and


G2 = (V2, E2) are isomorphic if there is a
bijection (an one-to-one and 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, G1 and G2 are isomorphic if their
vertices can be ordered in such a way that the
adjacency matrices MG1 and MG2 are identical.
05/17/25 1
Isomorphism of Graphs
From a visual standpoint, G1 and G2 are
isomorphic if they can be arranged in such a
way that their displays are identical (of
course without changing adjacency).
Unfortunately, for two simple graphs, each with
n vertices, there are n! possible
isomorphisms that we have to check in order
to show that these graphs are isomorphic.
However, showing that two graphs are not
isomorphic can be easy.
05/17/25 2
Isomorphism of Graphs
For this purpose we can check invariants, that is,
properties that two isomorphic simple graphs must both
have.
For example, they must have
• the same number of vertices,
• the same number of edges, and
• the same degrees of vertices.
• same number of cycle/circuit of particular length
Note that two graphs that differ in any of these invariants
are not isomorphic, but two graphs that match in all of
them are not necessarily isomorphic.
In most graphs checking first three conditions is enough.
05/17/25 3
Isomorphic Graphs

Two graphs are isomorphic if there is a


one-to-one matching between vertices of
the two graphs with the property that
whenever there is an edge between two
vertices of either one of the graphs,
there is an edge between the
corresponding vertices of the other
graph.

05/17/25 4
Connected and Disconnected
Graphs

A graph is connected if one can move


from each vertex of the graph to every
other vertex of the graph along edges of
the graph. If not, the graph is
disconnected. The connected pieces of
a graph are called the components of
the graph.

05/17/25 5
Example: Isomorphic Graphs

Are the two graphs isomorphic?

Solution
Yes, and corresponding vertices are
labeled below. B
A D D

B C A C
05/17/25 6
Isomorphism of Graphs
Example I: Are the following two graphs isomorphic?
a a
b e e
b
c d c d
Solution: Yes, they are isomorphic, because
they can be arranged to look identical. You can
see this if in the right graph you move vertex b
to the left of the edge {a, c}. Then the
isomorphism f from the left to the right graph
is: f(a) = e, f(b) = a,
f(c)05/17/25
= b, f(d) = c, f(e) = d. 7
Isomorphism of Graphs
Example II: How about these two graphs?
a a
b
e e
b
c c
d d
Solution: No, they are not isomorphic,
because they differ in the degrees of their
vertices.
Vertex d in right graph is of degree one, but
there
05/17/25is no such vertex in the left graph. 8
Isomorphism

05/17/25 9
Isomorphism

05/17/25 10
Isomorphism

05/17/25 11
Isomorphism

05/17/25 12
Isomorphism

05/17/25 13
Isomorphism

05/17/25 14
The End

05/17/25 15

You might also like