TWO GRAPHS ARE ISOMORPHICS

Arranged by Group 4 :
1. Dina Nuryana Wahidah (4101416028)
2. Hariyadi Salam (4101416044)
3. Wiras Walmiki (4101416079)
4. Asti Nur Wijayanti (4101416081)
5. Muhammad Fayakuun (4101416090)

UNIVERSITAS NEGERI SEMARANG

2017
Two graphs G and H are isomorphic also written as , if
1. There are one to one between V(G) and V(H),
2. The number of the edge that connected two points u and v in G, equals the number of the
edge that connected two points in H that corresponding with u and v.

Example:

1 2 3

1 2 , from first requirement there are one to one between 1 and 2 , that is



Take any a and b in 1 , n(ab)=1.
Since and , and n(ts)=1.
Thus, the second requirement is fulfill.
1 and 3 are not isomorfik.
Because, ((1 )) ((3 )).
2 and 3 are not isomorfik.
Because, ((2 )) ((3 )).
Exercise:
4. Check the graphs below!

G H K
a. Is G and H are isomorphic?
a h j l
b
c

f c

e d k
g i
G H
Answer:
G H , from first requirement there are one to one between G and H, that is



Take any a and b in G, n(ab)=1.
Since and , and n(gh)=1.
Thus, the second requirement is fulfill.
So, G and H are isomorphic.
b. Is H and K are isomorphic?

b d f j

a c e
g h i
H K
Answer:
H K , from first requirement there are one to one between H and K, that is



Take any a and b in H, n(ab)=1.
Since and , and n(gh)=1.
Thus, the second requirement is fulfill.
So, H and K are isomorphic.

c. Is G and K are isomorphic?

j
a b

k
f c
e
l

e d
g h i
G K
Answer:
G K , from first requirement there are one to one between G and K, that is



Take any a and b in G, n(ab)=1.
Since and , and n(gh)=1.
Thus, the second requirement is fulfill.
So, G and K are isomorphic.