CO) ‘QUESTION + 2) Show that @ complote matching ests using Hat's Theorem for the bart graph in Figure (macs) NCA)= 49,4,5 NCB) =41,3,54 neo) = {a4} N00) =12,44 wa B) {9.4}, (13.517 NCA 742,49 NCA, 0) F4 2.44 N(6,C)2{ 2.49 NCB. 0) =4.a,44 Nc. Dg es {aed Shown tat [nes] > ¢ “Hence , Hall’ Theovem — veritied teat Figwe 1 tras a complete matching -b) ») nH Bow ar Ow ‘The Toys R Us Company has four men available for work on four separate obs. Only one man can work on any one job. The cost of assigning each man to each job is given in ‘Table 1. The objective is to assign men to Jods in such a way that the total cost of ‘assignment is minimum. Table bt] 302 [Joos | soba P a Ee a Sasa ® o | im a B 3) se | 3 | a) we Uso Hungarian algorithm to allocate the tasks fo the subordinates to minimize the tota- man hours? (7 marks) 12 3 4 @\s |e 5 @is|eja a j}@) 4/6 3|'|8|@ tial3/4 Men Jeb Cost 5 8 Pp 3B aa 3 2 ee R/ alm S\4/ 2a [| By using thingarian algorithm, the minimize total man hours is 46 with man P doirg Jeb 3, man Q aoirg Job 1, man R doirg Job 2 and man £ doing dt 4-{©} Given the graph G = (V, E)in Figure 2. |) List THREE possible vertex cover of graph G. Hence find minimum vertex cover (of G and its vertex cover number, (G). (4marks) i) Find @ maximum matching of graph G and determine its matching number, «'(G). (marks) ©) Ci) vertex cover ={ 8.6} fe, Fob, LC, £,4,AF4 minimum vertex cover = 18,4 ACG)= a ai) © “LY matchitg number = 3‘question 2 ') Apply the given theorem on graph G in Figure 3 to determine the connectivity number, x(G), “Theorem (Whitney): Let G be an arbitrary graph, then x(G) < ACG) s 6(G) where, x(G): the minimum number of vertices whose removal from G results in scomected graph (connectivity numb), 2(G): the minimum number of edges. whose removal from G resus in a ‘discomocted graph, and {6(C): the minimum dogroo of any vertexin 6. (7 marks) KC@) = 2 Cvertex A and e) AC&)= a Cedge di and ef) 8(@)= 3 KG) ¢ ACG) S$ $(4) 9 asas3 <:Hence, the tMeovem (whitey) ir satistredi) b) 4) il) Cy" Figurea Determine the source vertex and the sink vertex of the flow network. (2marks) List all cut edges and capacity for each cut in the network and determine the minimum cut (10 marks) Find a maximum flow of the graph G and veriy the Max-flow Min-cut theorem. (B marks) Vertex A is source Verkex G is sink Cut Capacity Cof np acy 18+ 14= 22 Ca: BD, ACY fo +14 = ae Cs:180, co, c€F lor 6410296 Cu Lo4,.dF, ce la+ 8rl0 = 20 Ce: dG DFEFS lat8+q = aq Cot De, Fay lar 13 a5 Ce App. caer} — 1o+ G+ a= as The minimum cut is Ca with 24 as it capacity -ow min-cut man A~C-0-G =24 remimum cut capacty, Haus Hy graph & = Orit fi Ty verted. The magimus Since , maximum Flow the‘Questions 9) Suppose that a farmer needs to store sb animals A, B,C, D, E and F in various areas in his farm. Some of thace animals must be kept in separate arees. The astorsk sign (*) in “Table 2 indicat the animals that cannot be kept together. Draw the graph and calculate the numberof areas needed fo schedule all he sx animals. (oyepere opepe oT 7 (7 marks) vertex A|B{[C|D]EIF colors | 1} 2] uf a}ufa The number of aveas needed +0 scheauie alk tre mx animal % 2.) Find the chromatic number for the graph in Figure (@ mars) ©) Deine a cique number ofa graph. Hence, find the clique number forthe complete graph with five vertices. (4maris) by) [vertex Colours The chiomatic number, XCG) = 4 © Clique number of a graph is a matimum size ef a cet of pairwise aapacent Verkives e b w(G)= 5 graph &QUESTION 4 12), Determine whether the following statement I “True” or “False 1) Agraphis planar i and only ft contain a subgraph homeomorphi to K,, oF Ki, ) The Petersen graph have crossing number 2. li) His aplanar graph, then any plane drawing of G divides the plane into regions called faces. Wy) Maximum degree of any planar graph is 6. VW) Acomplete graph X, is planar if and only # n <5. (marks) bb) State Euler's formula, (marks) False Falee True False © True b) n-maf 23 fe number of vertices m= number of edges = number of faces.(@marks) 32 0 al no mee= 3 e-ust=a 6 for tre graph & verifiedQUESTION 5 ‘Consider the graph P given in Figure 7 4) Define « Dual graph. mn) F7&@-70-A-E-¢-B-F ) Determine number of edges, number of faces and number of vertices for Dual graph ‘Draw the Dual graph for graph . (11 marks) 9) Dual graph is an embedding of a graph Gon a surface § where a drawing of G ong such that there ave ho edge CrUings. b)