Scribd
Upload
7 views12 pages

PYQ MAT668 2023 February

The document contains various graph theory problems, including determining maximum independent vertex sets, vertex covers, matchings, and applying Hall's Theorem for bipartite graphs. It also discusses the Hungarian algorithm for minimizing assignment times and explores concepts like chromatic numbers, Kuratowski's Theorem, and Euler's formula for planar graphs. Additionally, it addresses crossing numbers and the planarity of graphs.

Uploaded by

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

PYQ MAT668 2023 February

The document contains various graph theory problems, including determining maximum independent vertex sets, vertex covers, matchings, and applying Hall's Theorem for bipartite graphs. It also discusses the Hungarian algorithm for minimizing assignment times and explores concepts like chromatic numbers, Kuratowski's Theorem, and Euler's formula for planar graphs. Additionally, it addresses crossing numbers and the planarity of graphs.

Uploaded by

Jem
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 12
‘QUESTION + 4) Given the raph G = (VB) in Figure 1 Fouet |. Determine the numberof maximum indapendent vertex set of graph G, (6) |i Ust THREE possibie vertex cover of graph Ji, Detemine the vertex covering number. (6) of raph 3. Iu. raw any TWO possible maximum matchings for graph 6. Stat the matching number. « (6) ef eraphG. (eras) 9% (i) vertex cover = 40,0, 65,126,085, 4A,F, WTF the number of maximum ‘independent verter set = Q GD vertex cover ={A,0, G4, {H,G DAF LAF Ty Ci) minimum verter cover = {A,OGF BCG)=3 (iv) ©» ») | BE ¥ ; (vy) matching. number = cize of maximum matching mat ning numben = 4 b) XYZ Bakery advertises for a pastry chef (PC), a cake decorator (CD), a bakery clerk (BC), ‘2 dough maker (OM), and a chocolatier (CH), and receive six applicants - Ranee applies for the ob of pastry chef (PC), Suhan apples for cake decorator (CD) and pastry chef (PC) ‘88 well as Tania for bakery clerk (BC). Meanwhile, Udit, Vidya and Warda apply forthe job ‘of dough maker (DM) and chocolatier (CH). Draw the corresponding bipartite graph. Hence, by using Hall's Theorem for bipartite graph, check whether all the jobs can be filed by quaified people. (7 marks) Pe Ranee cp guhan BG ——$—_—$— Tania om Uait cH vidya Warda ©) The director of computer center has five expert programmers namely 1, 2, 3, 4 and 5 who Teed to develop five application programs, A, B, C, D and E. The director of computer center, estimates the computer running time (in minutes) required by the respective experts to develop the application programs as follows: Use Hungarian algorithm to find the assignment pattern that minimizes the time required to develop the application programs. (7 marks) AB CO & ( 0 54 42 a5 45 2° 4% F278 33 0 3 68 GO 46 0 40 4.0 54 3g 40 41 5 48 F2 1% 41 0 Al Biel ole Expert Apps Times ' 1 A aa 2 a 6 al 3 2 D 13 4 4 B 38 b 5 cf 34 “+ The assignment pattern that minimizes te time veauived te develop ‘the opplication pogroms is shown with mivimum Stal 168 minder 28) Consider he undering graph fr the graph in Figure 2, Draw the underyng graph, Wile

You might also like