=> Cn-D Dy oG So WW hay Vertes s within Fie Ibedges So it has no hamilton cycle; Q) QD Chaos forest with ptrees show lel =\wl-P Mere Are P componairis of m vertices: A Component can Wave any no. of verte § bot i} Mut be atree ‘ ah \e+ number of vertices iw Component” lp lsd P Son tea: weit WI wertices there are |vi-l edges. So iw F*co WE Ke edges wi be there Betjl--P. STotal number of edges uAl\ oe \El =o Z X&rI we) 2 ee tet "4 - W\-P Giver stafement iy tue y% ia ytskZ eb Ge=(VUV2,6) be A Complete bipar hte araph and My aWils 02= Wal for wich Nonpen does G Contos Q nomi ton cyde As a Bren @ containg atiamiltonian Cycle S Gs Cyuy,e) be a Hiportte graphy ® be Vlaywiltonion graph, it needs to have hami \fentan ae Le one Which ULitcal\ the vertices oO. GS AS each edge in GQ Connects averter Invi With vertex iW V2, any cycle atter natively a through a Vertex \AV, Gnd then tn = Without loss of @enerality Coppos® Wal > lal =s VV has more vertices than V2 Wi len, > Wale a2 non Suppose Gy has a hamiltonian cycle C- let cycle starts ar & vertex Vin Va- Afler 2n2 edges have heen tranvere) we val acre bate te V and all vertices inVe ove Visited: Rot there are Pi-W2 vertices iy Vi Wich are nor Visi ed -, € eonnoh have hamiltonian Cyete. =A ssumpiton is Wh Ong \wle Wel 37 1292MAT Number 4YO3343 Task4: A minim Sleigny Spanning tree is a subset of ed of 0 Connected, |eAQe weighted undirected graph that connect AWN the verkees together without ony cycles amd wrth the miniveum posible, total edge weignt: a) The Gwer graph has (Overtices. As we know tat a gv Wouing 1 vertices has spanning tree contains all » Verhees and (n-\) edges. Therefore, spanning tree of the Aer groph wi have Cio-\)= 4 edger A\gprithen: To construct a minimum weighted cpamning tree of & groph, we select edges of minimum weignt one by one Ww guRK Oo Way enclosed Path qhoo'd not be formed. To Bnd tre minimal Spanning tree of a groph , first select thats edge which has minimum weight such thet selection of it does nov form & Cireuit,hente, if we select edge (&-D)ef weight 2. Then We Select minimum wernt edge BAVof weight 3. fer thod we select edge(3d of weight 4. low wé sekect edge (3-losof weig nt Ahern edge(S-4) of weight’. Then we (elect edge C56) of Weignk Cand edge 0-1) of werght€ Then we get a Minimum weighted Ponning +rees stepa step2 St ep3 Steps we eight Of minimis spanning tree- —Therefere the weight of minimus panning Aree . ison b) Now ifwe add 4 edges (el,e2se3 eh) of weight 3 each w Yre gven We Then the extended graph Gace, Gi OYE, Let,e2,e%¢43) Now if we want to construct a minimom Weitgnted spanning tree of Gy then we need Ao Consider these Sur newly added edges tos. ifwe use anew edge of weight in the Sparning tree) Ther atleastone of the edges Cof weight more than) Previously used In the Munimum weighted spanning tree need jo he vemoved: Ther the weight of new miniwom Weirgnted fpanning tree wilt Wave less weight Than 33- Hente the new (panning tree would wot be TY. Therefore, we conclude Mok it is not possible XD add four edges (ee? e3,eu) of Weight each wn Grae’ G.Soek Rot T is alto 4 AM Wweignted SPamning tree Of new | % grap &.Ea G d2 con be execoted in Paraltel ene for Hose tond Processingtime for tase A ig 2h | Processing time for tasie2 «sé. Since both Fass are executed pacaliely therefore ae timer the executionof both toslts Now Taste isexecuted since 118 prede cestor touk Vowd 2 is Comptete. bo the execution time for tase 16 23. Now task terewted ots exetuhon Kme fT Now tusk ts erewted Since Us predecevol 3 and § fe Completed So ts efecution hme is 17: lastiy tasle 6 & eyetuted and itt execution Wwe tal2- Therefore, the totoh Hme for erection of AM Fasksis B\whek & minimum: fo the asi ble Schedule for Yee winimum fatal proce sing Hime i+ @ AGL paraley 939 S127& b) Tose and 2 are the ose CTO “yesics loecause tf Land 2 are not erecuted Man 3 Cannot be processed and as cesutk Fos 4 anf prKust be proceie ince CASE & is dependent upon tasey | and S So vitimotely fasie 6 will a be not protested: ns 3 whore fore i tase Land2 are hot proce. Ahern we We be unable to execute Gn