discrete structure

L

~=er- –

~_,·–::c

-~ -G ~ap~.’ ‘, ‘ ,/. ·., • ‘· : ‘,:,1’t:/t/f~t:,,,t..:
-D ~Graph ,G:;:,(V,. E),’ wti~ne V~(aib;~, #’,1M1) i~:f,7{(

,’ . :

I

C :,1 . I ‘ )’ ‘.is{;, ,!”1/\,’i
O Graph 1~:;:(.~rE), where ,V={a,pJ?, 1;e,if},1,f;~’ :fi, ,
D Graph G=(V;E), Where V::!: {a fl;>Jc,,d, eJ), ,E;,, {{‘a,;ib}i\{~(‘fJ;\ ,;{};, 1(,ei, a,)’}:,.,: 11 •

1

1

:i/’,, ‘,,” ‘

– ·h, ,, ‘ .. , ‘ I ”\,\ \,’ ,.,,,’:,,· \:”1,, ,,,’\ ,,,, ,’,,, ,:,,,,,,,, ‘i,.,,,,,1,,’, ·’,’,ii
11 I,; j·• ;!,-ri.’ 11 .1, ,1,, 11; 1 11′!1 111 1t,1,, 1i’ 111,

0

0 111 0 0 0 0
000000
11 000 1
l O O O l ‘O
010 0

11

1 ‘O ·1 01 Q,
010000
0 0 0 0 0 0 ‘ I’ 11 i

11
1

i ,I’ il; 1 1 0 0 0 ‘l 1
1 0 0 0 i 01 ‘ I’ 1,’lr 111 111 11 1

,1 . ,, 11

11, 11

I I

I I
.I ,i

I I

)~ ‘ I l j JI Il l 11/,! I 11 I , ‘I I I 1 1 1 I I II 11111 1’

QUESTION 5

Construct a soccer matclJ graph . Te’am USA won over Japan, Germany won over France, Brazil lost to
USA, Japan lost to Germany, Brazil lost to France,

De fi ne G, V and E in your splution.
Attach Fil e

Bro wse Lo ca l Files,, Brows e Cbnte nt Collection

C

0 Graph 1
0 Graph 2

” ,,
I 1;, , ‘,,

·•.·Gr, ph . :t•
1′ • ‘. ” ,. ,,

i;;i

I

r

I
I

I
I

QUESTION

(a) Is th is graph a bit.arm e graph ? Brief ly exp lain.
(b) Yo u are allowed to addl de/,ete edges, to produce a bipartite graph. Define th e bipartitie grap6 y~ ur
produc ed.

r /
I

(a) Determine ‘whether the given graph ha~ an Euler ‘circu/t. Wiefly exp.la in. Construct: such a circuit when
one exists. , ,,, ‘ ‘ , .

I, ‘
(bJ Jf no Euler circuit exists, determine whether ~he 15rapH has an Euler path and construct such a path if
one exists. 11

\11 I

• I

a b
,,
I C