‘7. Mi -anage THEORY i a e Gi fes pol (v, €) Where Y IS @ non empty gett “ gor i we ott these eements are Called yertices (nodes 0% points). nn a arather set chose elements are cated edges (lines) . 8 ate, graph G coith vertees Vand edges & fs conten s. £) con) OVE). Here v=fuyVoy £28014 Vv v2 a: oer der! af on edge €€E ‘8 associated ith an ordered pair © uw rere Cu) eV. |. ecedg® IS connected to u and Vv oK@ called end points ee. | leery 400 Vertlees Comected by an odge In 4. graph {g called 4 adiacent vertices. Ary tuoo edges gard es are Incident Cth @ Conran point \ J con vestex then thay axe Called adjacent edges. { peel ey er e3 oe Cuny) 3 Vy ! : eu Here e has two adjacent sestices uondy, Inthe above gvaph Vj, has +H adjacent edges @1 and eg. ‘fond vi denoted a5 Incident veotex. . i VeSaibjcyd4 ond. Ex §(a,b)(010) Cady} draw the groph a: ee . ae tinieda condouct the vertices and edges From ee athe Sor-the given graph G2 (VE) : A a.) Ve S Sarbicid f= $a (bO(AY : : \ leop:-Amedge 0 of a graph 6 that Join anode to isa is” _ ied 0 lop com) see loop defined as e =(Vi/VI) Or || Sa-816_ Y, | Muttigraphy- 2 more than one line (edge) Jcining between tua9 Neatices are allowed th a gzaph then the geaph is alled | Muttigqnaph. Ex- Mo ey, \ C2 es; Vs Na &3 Ny exi- 4 Ye a ey QO ey j ‘3 vi j uc groph:-A geoph | tn cohich loops ane} reultiple edges j ere allowed Is celled ae geaph, BUS —2 1 ae itine | pected ‘and Bete geaph — Undeted gregh'—An undiected groph G has a sot oe eed | Vand @ set oP C2988 Such bat exh ee eck Is “associaee pois of vestices. cece aay | ¥en ings eo YBa ES ae Adivected graph G a a set of =) fod 8 gi of edges E sixh that eath edge ec'E ‘g ocsotiated “oth an osdesed patie of veatices ; means divectionS oneach | edge 2€ (Vl VD) rd sepegee of OL Veotexi—the deqoee Pa \extex VY OF OD Ul | ggaph G18 the no! oF edges neldene sith it-the degzee: OP * 1 at vesteX denoted as deg(v) com aly) tips lexi ne ‘deg (vy =2 ceg(va)= =3 ; i ni v4 deg (va) x3 degiWy) =2 3 rod Vue. . 7 \ ue degeee.of Vextces Eso glyen diagearn. , 60- deg (v) =2.+, deg(va) =2 iv fi: deg (va) =3, deg (Vy) =9 3°, deg (vs) “ly deg (Ve) =0. Ni Ve Ve Note i4.the vertex degree * © 18 called’ Bdated vertex” She Vertex wae Vis! cited ee Verte ee WnlG fs (Lot Hynk or out-degreecn ated feted hs Yen deg Fa vertex oF 2 divected graph G Is the | Mrtor of edges recelvingtony ending tosi)coming at V ond “Stat, jdenoted as degiv) tom Indeq W). The outdegsee of a vertex V of directed CR edges going (ori starting (on sending ok degtv) () outdeg (Vv). deal) =] deg (Va) =) fxr deg(v3) =| le) 22 Indegree ( graph & Is the y and denoted os deg’ (1) 22 degt(va) =# degt (Vs) >] deg Hays) out-deg ree | Noteim 4 Ge vy,e) Ig a directed greph with edge e then E deglv) = € ded (y) =e veyed vey g © Lecenstauct W-degrees Ord out-de grees Fron ghe0 graphs. G ay Be Gy so ye Cop oe vy ; &) { Sd1i- Por geoph | | degen =9. ded (vn) = i degiVa) <2 Clegt (Va) <2 | deg (vy =] log (Vy) = 2 i i . yd ons | degVo)-9 ded (¥9,- 9. fal ai: & degivin = 96 I= | &3 & for graph 2 deg (ain = deg Cn degc@g). eg (G9) | deg (aa) =) deg fa} eg Coy): ) degt tout | ‘ deg (Gs) e] deg (Gs) =\An4 apni © graph: G in cohch node Com) Yertex jg (Solotey ced @ Pull GOP. the verter 17 has" of edges ra ao Ng. venge® QBN Asimple graph & (8 Aid to be complete ofogh every vertex In G Is connected with every otter Vertex, ve exactty one edge between pat of dietinct Vertices. le ui “ie ® ® A * regular gephi- we @ G has oll vertices: of degree ig eau ig called Q Agere hipartate graph: A vir G=(W,6) Is saidto be apart bhi us the ‘Yéxtex V con be divided, into 2 disio’nt subsets Nendo euch tot evesty edge 2, Connects Prom Vito Ve-NO_ Is connects efthest tex vertices InViCO) Yo O8.G-,We é ok gy (vaiN6) et aiesinaion OF edges ion ey a Cn Be ae hiStn,~ Too graphs Gi ath &1) and Ge =Cve/E9) ore | gold to be ssorenpbie ie tere exists a Biection #:Vi Ve, | auch that (Un) € €, (0% adacent vertices fn Gr. (uavayeEs ase. adjacent’ yestces in Go. ab ae degiece cf vertex ih Gy are eayfvotont bo degree of Vertex in Gp, the adJocent vertices degrees are. eqyia) in Gand Gig Such tot G) is ‘somorphic to Ge, then Le Weite AS Cy = G9 .'- (deqseas Of Vesttices ore Same). , UW ur ce M Ye ie V3 deg (Vi) +2 © deg (un =2Q eeq(va)= 3. eg deg (Us) =3 ; fe eg (vy) 306 deg (uy 23 SeguV3) =3 ~ deg(ug) =3 “ges: ye degcus) eg > | [Te gies Garg ce Somoxphiam, ee eh ekaFN Gand 1. Shoo that the gallocaing graphs & a ( 1 2 a b 3 4 & q {St degen =2 @ degla 29 | deg(2)= 2 deg (tl =9 | | | 1 Gore isomorphic. 2 deg BP=2 « daogib-ao deg <2 deg h=2 degtdy be ig . 2 Poe ° b afololo ae 18 | fn f oloty dli ol 00 flo 1 100 The given adjacence mately 13, It ag. Oo bede. ugg 98 [hed oa ame ete bape aa riven ancidence mat Drow the graph from | M=floio oloo \oto C100 8ol\-The en Ircidence rnatet 1S T= & eo €3 ey me c a (eloy o eT i e3 { b]oloo Giorno Lad ©1006 j cqae | “pais ond chats) — J WAlEI— A walk oF @ graph 6 is dePined as an alternating Sequence of Vertices and €dges . Voeowi €; enVn, Starting is Incident Aeaalk Toiring Vo ond Vey tg Called Vo-Vn alk - TE Coriolis oly o Single vertex suha walks fe Colled taivial coat 2 TOili- A HOIK 18 Called a Trail WP oll ts eq and ending coith vertices Guth thot each line e} ith Vi- ges are distinct. B:pathi-A Walk y uy Ph aw a Nertices 4 WS 4 closed path—A closed path ig a path thak starts and ends ak the Same point 9) vertex. 5: Circuit s— 4 Clreuit Com eycle fg dened ag a closed path ie oesaae does not Contain eoted edges (ohare tet ou ln “{ ) eyJ s 6) We 06 ve ee oe is LK a le YierV9 @av3 : . a.vive.eov3 C3Vue 5 V2 Ca¥. ; Way 8283 g.eaV3 C3V4eS V3 , . aye Wallis - S yieivaes Vy e3V3 eae e6VS (Sa boat - yp. wieaVy 3329/2 e6Vs 18 a path. 5 VWW225 Vy e3V3 eave. eiMi [3 & closed path gwen’ yesvee vy 4. Wenvueav3 eave ev, are Circuits - ypekermine of the following Seqyences ove circuits & paths vi ey > Prom blow GIOPh - : ey By xt ve eg vues v3 & Ww LISA weve eG Vues V3 C2 VE ey sti : amelve C2V3 Cavyeuys vq e3. | gv es Vyesva e+ vies VY. : gevses Vi eg Vu eda V2 26 VueU VS poe : 5. VoeaV3e3 ulus es vierve 4 ip ropeatted tw ce, Soit Snot a path. ‘Sol [vesitex ve 1S ond ending verter v9 Sot IS nck Crrealt Stoning vextex Vi jesicices Ore distinct ral {g a path. + ghere all ending verte% 5 $9 Ye 1S Not o Creu: S aearting verter Vi 3.uere vertex Vi,VuU are repeated , So it Ignora path: gioating vertex vi ending verter Vy, soit Ig « Cages it is not o.paes : ig a. Grab me, eck se HerenVereecyois Nu are fepeated, So: stontinguantea vending Némtex ve) S0 fe— 7 ss a“ ee, sae ig note @ pAb ik, 4 ted, So It. isa Circus S.here Vols ropes! erdeg yesrtex Vo. S° it ew” Stonting Vertex V2, \ eo ay ery 2. 12t the graph 6 (i) Hous mang. pats waiissne are there Bon |boy- (fi) Hoo many buon . es Sar ep pt oe for tow t. 1e2@33e5 4 2. je2ea3esy 3. 1 243 eSY she ‘posse ‘baits are From Itoh ig 1. 1eee3 Se5Y Ute} 909 3€3 ey 3E5y 2. legee3esy 5112e9 3ey Be, 3e5Y 3 lereey3esy S- 1€\2ey 3e9 9e3 Be5y H leiseusez2easesy ——g, 1€, 9eg 3 YD. 93S Y & Le 2e33e9 wey 3ery, “euterion graph ion Eulerg raph (09) Eulestioncicuit,— VA trail tn 's called on Euevian boll Cdistince edges) 24k Contains all yerticos atleast Once of G S Aclosed Eulerian trail (stave anderding Vertices Same) Called: Eulerjan gra ph (on'Euier cfreuft. ei |!" Afpath n'a Graph G48 catied on, Euler eVETY edge» exactly Once, Cdliot nde: 2. visit” al vertices. at least one, Path FPNE eIdes edges) metas5 per \EP & Ba gaph Much we eegree “OP ester vente ig over Hen ik ig poasible to construct euler circuit te graph G 19 @ Euler path iP atleast one degree of vertex. gp even: gait the. given giaph Gris. et a Eulerclrcut and path if and only ie Its vertices has odd degree ppecerrming Whether the groph is. Euler path (on) Chrewiit. 4 vy v3 gol From a given graph vertices Va $ ¥1,¥9,¥3, 444 or gndegree to every vestex {3 M Ves deg(vn =3 jdegiva)=1, deg (¥3)=1, deg (va) =| putdegne tO every Vertex is ne ae 0 = 1, deg! (va)=t, deg! (va) 2, deg (vu = | Hew. te Wre Vetter Yiand V3 has odd degree =3 othe Euler path is Na-¥E-¥i-V3-Vq _yy. a 9.F10m the given graph chock Whether Euler circuit or path . Sols- Piosn given groph vertices = § VI/V24V3, vu,V5). degivn =2, deg iva) =2, deg(v3) =4 deg(vy) +2, deglv5) =o : ics Here atl the vertices have even degrees “the euler Circuit is vi-V2-V3 -Vy -¥5 -V3-Vt- Sol: fom guen geoph z < Votan u Sa b,c 4 eft ne ieYEO) = 3, degiby +3, deg ( =3 a Gegtd) = 3,deg(e)=3, deg(#l= 3 Here all the veattices have odd deqrees=3 ° TWe path Is a-d-c-f-b-€--F Here b-d e~c edges are not covesed. So it IS nota path. 80 It 18 not a circuit. 3410 "Grattenian glaph;-, circuit in a graph & 19 called Hamottany Civcuit con) graph. 2.4 It contains eachvertex h G exactly once except for the Start and ending vertex that oppears twice, Hamaltonion path’ —4 Hamattonion path 1S a path tha Contains al vertices; OF G, Where the end paints ¢ Starting and ending Yertices) may be distinct {Determine hich of the Following graph Hamaltoriian circu or poth dy Mee & Sali- Gi) From qven graph es a v3 e3 Vertias Yew, V2 ,Va,Vy, vsy Ye &y Vy ‘The path is vj-Vs—vs NEM, ty a ‘ 4m this path all vertices vigiteg eractly one except Starting & endl sing Verten. e &9 “aeig Homaltorion chit. : od $3 | ah from ghen graph serie veh aye cre teste 18) obe-d, Ly i uiss. vp ankey,pe path all Verices- visited exactly once “and, étaitin, aa cae vertices are distinch « “'d {..56 IS 0 Hamaltonian path. i f pipera, ode uy D1 Sey gtte JNM graph cahich {8 Horrattonion, clrcutt (on Euler create gps th Cosel Prom given. graph cy Oe Bee “Qa tsaser83 6 aN qre path {8 a-b-c-d-e-P-a ees e ey do pins path all vertices visited = (tl) ! exactly once. except starting and eh ef erding ve NerKed st isa ; Homattonian chreuit. > case? \-Préae given graph degrees to all vertices: dt degtaye2 ,deg(b)=5, degi<) =2, deg 3, aeRa%s degtP) =3 i of vertices bid €,P has odd degree tHs net posable to construct guler cfreuit- ci Pasel: - Prom given graph vepviV2, Va Ya Vey vilip ort the path ig w- RRS Yo Vu Ns, vai Here all vertices visited exoctty once but Stig and ending verticss are ‘dihnct he 1 2 4b18 Mot 8 Homattanion Crauit- oe t= aor given graph Cegiees to all vertices degivy = 2, degive) =4 , deg(a) =y, deg(vy) =2 DQ degtys) =, degve) =} i ae si wi elyey. 2a a wae The path vs vj -vai-Vy els -P3-"6 - see ° and ae Vestticas . ‘Seth Here all edges exactly once 4 and ending vertex 1g Same. F ict wat 18 euler clreuié lor a Aaaph G iS called & lanai h uh cis graph:- gre! is call p 1 gop! K be drowon In a plane intersect Except ! NE Such that no two eages \nters CEpE-ak , the veitices. © eve h = : 1 dy. So ‘OS : a Pana \ d t.petermine the graph fg it planar ton not. b Soli=The Planar-graph 1s e > 7 vam , ’ @ahe given graph is planar ton not Sots ati the Penay, graph is 2 ise * Copy bob ye v= (podpare. given 00 raphe Ore, poner: or no. hf Oo Sg spy We penargiaph te we 9 < Belg a plow” € pee d ‘The planar graph ig ye graph. ed, b.€ . e JN ia dyaje,ci : Ob, e 4 N , ' : a,c ,b,e 4 “graph Bk 1S nok posite to design We btod ‘edge. ae (So nerparas fey eoroplete graph and above ove equa to 5 vettes thot 1S not possible fo design tre planar rm wt These are nen planar graphs. wig wi : yin characteristics:- Ny e+ne Wiere nv = “hurmber of vertices {0 ° “groph. aa bap primey wet = uw edges’ “ J See adiehtiney vile DANTON ty DR watch faces (ahr regan aa! big goa ney ak ig be combination ‘ interior and exterior regions shay get dyeig oe panes rey oe he. of vestices © “hs g 5 a We iby out tet edges! hE = 6| NO-0F Paces er) regions Prem gwen J | Rr a-b-c-a , Ra-c-d-e-6 | Ri =the region bounded by te oot [Reese a ky os raph P= * . &, e@ a-b-C-O° c-d-@-C. Here rand Re are interios seglenS- , tide he extestios” segion R3 =the plone groph ou! path Q-b-C-d-e-c-a. “Ng =3. 25-6 43=9 | The characteristics to given groph nv-nesnp +5 e: a 2 construct the characteistics to pane glaph. Soli“ no-of vertices nv = 4 6 ce i \no.of edges ne -y EONS N0.0F Faces(ox) regions From given graph nP = Riz d-a-c-b-a. Here Ry Io intesioy egien the exkeslor Yegion 83 -the Pane cutsi de Path o-C-b.a 2 DP =o The characteristics to Fen graph ay-nepne = y_ Te 3 to Given Graph HP = 4-49 ~9 ‘Graph colouring and Covering, \ Colouring i— An assignment OP Colours to the Yertices cha h and no to ad} f geoph nian) G@acenk vertices get- the some. Colour ig called colouring of the graph Can vertex colouring. ba PCa) = Red Cc) = pint b © lb) = Bue PCS) = yetiow.., yaapore Numbers- the chromatic number oF a.groph G, bd “minum number of Colours needed to colour the 9 ! yerticee OF the. grap. and denoted bey sae ox) --en¥n) and vn is achid Vertex Nevery path, Big yh —rexcept root and child vertices Temoiriin Interval cosy middle vertices . “Te level oe a vertex V In atree |g he eg tre pat 9 all vertices Ore!) fom the root the height of a rooted tree Ig the markimnum ; $0 ouamben e [Re jhey yeam the abwe tree a 1S Took Heder» Cor) vertex. ! Here child nodes ave 4, @, ond.g mtewal Cos) terminal Yertices are: b,c and ¢- — Pabrcid,e,f andg has 6,1, 1,2 ,2,2, Sarre. levels tespectivgy | to all vertiass - \ | —streheight of bee ig v3) 1. From the given yooted tree T" C) What [S the root oF T® | Clfind the levels ¢fnterval ver tees 2 sCitiy what are the levels of wand 22 Civ) Find the chitds of Wand z? * Sol:-C)Brom the. given tree. root: ede, Is ‘u’, @Qy ctl the levels of given tree y VeOpK, YZ), yl el ON, 1D) 87 B93, Ha “he Mterval yertices are t,o, x LY, 2: (inthe level oPcy fg 1 and level 02 z Ig 3. | | (iy) The childs oe Hand z are x! vi Zend 2. spptiing tree: tree “T'ls 0 Spanning tree of a. gagh oy T13 & Bibgragh OF & that contcing all oF the vertices 85 TPG ig. comected. Graph ccith n vertices on aspanciing bee OF G musthove o.| edaos.ya tb ’ G c d ’ a A.determine te Spaming tees from given geph ; soli the gpanning trees ore : b conf Api ‘be b co Poe . BES and DES 9 Sponni panning, trees — BFS ( Breadth first Search) :- | BRS. Starts traversal from rootnede ond then explore the — Seerchy \n the level by leveltrat is as possible Prom Toot pee. 4 e bi 14 bw 2-BFS Conte done coith the help of apueueLFirst:in inst Out), 3-the BFS works 6 a Angle level then visited vertices are emoved. From the qpeue unti! all vertices In ‘eee DES (Depth feck seer carck: - bs aes. Gants fan 8, jMoversal fsom the rook node ond explore vaste eeeA oo gn iadonh soe ees Bite search Ar as possible fom the root node tak Is eth 34," j | 9- DES can be done cath the help oP etook Chast In Piste Ou) , 3: Joter on. hen were 6 no vertex further to visit. alll Verticey | Are processed - : Noke'~+1.DFs ig more faster thon BFS 8.068 requires \ess memory Compare to BFS. i ° Bes: a-b-cd-e-P-g, \ DFS 7 a-b-d-e-C-P-9. @ OO2r ms \-use Bes and DFS find the panting tee For given graph Soli- BESI- (+ The root node iS a (Ce @-node aq hos two childs band e& ©) = oy OCB ede @ and’ 6 has child 1FT cowst) olor ; rk 3. nade c hag 9 thlids d arde and b has child d @ut it Gill Oye TI Xe + boldeatt ved ind eye me bake en ty nodes £ ond q: © ; it} ead mOkyK9 bag sbort door gat vat} fy Ci Pera, 8 eb 68 PY-— a cn! ig is one child 5 gne ree DFSi~ veo, We fc,by eq wha vee wefey ved cof erg, bch we! aes wr $d, 6} veh hegay “the DES {Soc ~Enfird eg sh-b vib W={d,0y 20etermine BFS and DES soli the given graph gad paae8 - BFS} 2 € ey e ithe root Mode ig a @) +t Sue root Node a has 9-chids 6 onde uN fe we J Israde dha oe ne © . iid node e . Sade 6 does rot has che more VO sont Meachiid ches tuo child nodes! bah dane. 1303 fA & oth eaigy/ Ysa veb | vec y-d \ea. W=ld.c¥ OS eas wif Cy wef dey ben MER Jothe pes is | WetFicy a-b-cd-P-e \ BsTemicimum Spanring tree) i-A minimal Spanning tree \ gis O Ganring tee —EB with Minimum coeight to | constsucting rnishimum Spamming bree’ use folowing Techrigeg i hmapral's: s: for MsT 2 prims for mst | eats for Mst: elect ory edge Of mnmum volue thot 8 nota loop this_Is the First edge cP T. 2-select ony remaining edge c& & having Minimal value that i does not form a ciqcuitt with the edges already Inctuded int) ge 00 orithrn for MsTitselect any Vertex. and choase the edge fe trimer caeight fom 6. 9-Ateach Gongs igroose the edge OF Smallest caighe Jsining a 3. aoe Step 2 tant ee Contains n-} edges i _verkex already Tocluded fo vertex, notyat included , | 3-contique-untit ‘all Vertices are included. tFtnd 6 rafinun panning -tree_ oP. the eng grsph Qjven bec ushg krystols and paim’s algorithm. Prins Zoli SERS for MST iq aayOO Tages gary §aidd farcy pels “pany they thd} fbi Haig, 3: ! 9 5 3 3 gady faey 4.We have to consider 3 Qo $d bj! a1 tot node = © . I 2.We have. congide, . faey=3 pended set ! | i | e 5-We have ko-'congider » ts i focyse | a =f | | 3. He have to consider a. . fed 29 € Roushkeal '¢ 5s forms;~ edges faery fady gach Saiby fey hid te 3 14 Wes 3 3 3 he foBegopibes Sai ee sady ede dy . 3 Oh caoass“aa * \ the minkatum weight of genet: minimum weight Lit} alinodes $ bd} € We ps pe d d une miriinnumn coolght saey =3 | 2 ment $425 =2 | aan a | © b Pe € / aA A v4 a * 2 d c 2-constouct the minimum APanning tree using krushkal's ond prim's algovithm. Pastels R4 gor- ag ieee = ENE cloocithmn [edges fa,by ga,F4 Faeyr Weights |S ¢ 2 Thich! Roy Edy 84,24 Ediey 4 ig 5 t 4 ehiey 8B & 1-4 18 rooknode t ® ibid 2-We have Consider faey.g'75 we hove tocorarder Leky = 3 ® ® © - yWehave bo consider fFidy= Q eo © 5. We hove to cersidgr Saiey = 5 &.We have to Consider $cjby=y : aed “abn - ' f edges Faby ath {Uly Fhch Loiey ody adi Gelgits 3 Beng Sxba Oye et foe} §heyss Ye y “A.the nalnimum weight of All nodes fs fa, R4 ka Poet ad 2 netk Sb Fy =o Yo Sioa inst anf aa Sas sana aiinT] 5: bexfdey oh iy 2 | bi 4c.” eB ig Kenext $bicy -y boos, ' a | poy gale Binary tree ,-1A reoted Free in cahich the chidren of @ach vertex or assigned @ Fixed ordereing is Called a. Binary 4 tree. 18 dither each vortex has nochlid ,one child con te20 Silds | gcPa tree has one child then that child Is designed. oS ether | yeftchild Con right Hid ( bur nok both], Lae eivertoxLcon node has to chiidren then the First ohid is i | designed as leFtchild otherchild [¢ designed 03 right hid. size is Q a height h=3 . — tte above tree Size Is q'and helght 13 The rot node & “2: the child nodes are 2S,U,4%. aate os wt, pSeord er FBADCEGTH Morder- A BCOEFGHT postorder:- AB ACEDBHIGE , i eonstract preorder, \norder and. postordes, From ne qr th, gol" preordest\— : ABDE CEQ srodeni~ RaHR GER DBEAFCQ postorde- DEBE QCA, i ‘ | que erkeXI— A cut verter of. a comerted graph'G' is Q | yertex,@ Which {g removal the number of components. EXi- ° a 2 d ruere the vertex ‘c' ig a cut vertex. ie ee aie removing the Vertex’ ft fs dividing Into tuo i | Components faiby ykdiey. | cut edge (edge) —A cut Bridge oF a.connected o's’ fs removed Increases the 4 “of an edge catch IS number of Components- wa \| aR > ere Cea) Rage cubiedlge (en riage == AF COe Eye rEMOVING Ce -) edlge the. gph Ig divided {nto two Components, cut get the Set of all minimum nymnber OF edges: PG cohich {9 vemoval Con) afdcannect & graph 8 fsacut sie oe ey —_ a c al 1 \ nn) a b im — Here. remavli Wing oO kao eelges $00 -b), Cen dy. ; athe giaph alviding toto tao cones 1 ‘ £ € b ep} ” c qd c q ~—P Hebe the cut Sets fg Sb OD: HAL es iy Wo eet