12

14

Pigeief3
PART 8
ne full question froin ೮0೫ (४0740, each gucstion

Modale -1 ⋅
(Answer curries 14'n Wk’)

0200031206001

3(5 ‏عمق‎ compjce *'pH Old complep2 bipnrolc gnph. Dmwe graph which a 7001701170

graph *5 well 15 a complcle bipaniLe graph.
0) Explain walks, paths and circuits with Lhe help of examples.

a) Define isolated vertex, pendaor verlex, even veriex and odd venex. Draw &
graph thal contains ell tbe above.
‏زط‎ Prove thai simple graph with ೧ verices and k components can have at 17051
(०-:)४०८+ 1)2 ६४९९5
Module -2

8)

Find the union, jnletseclion and ring sum of the above graphs.

४) State cavelling salesman problem. How || is related (0 Hamiltonian circuits?

a) Prove that ന 8 complete graph 1:11) മ verices there are (o-1)/2 edge disjoint
Hamilwnian circuics, 16 is an odd number and ‏۰ھ‎

8) For which values of m,n டீ the 0೧171010 graph Ke. gn Euler graph 7 Jusuly
your 12೫7೮.

Module -3
a) Prove that & binary tree with 7 vertices has (n+! V2 pendant vertices.
b) Using Prims [हग पा), find ೩ minimal spanning 00 for the folowing graph.

—

दै) Write down 1211154778 algorithm and use it 1೧ find ihe shonest path നന 5 to

7
7

नै