our assumpdton | es: | Lo oN . oN © scanned with OKEN Scanner Up Vi we ave SAT= QP, 40 hak oat] = 0 | J. KGUT] = 1S) +17] ——® gain, by the definition of S ene and AW) = ITI d(u) = [sl d(u+d(v) = is} +17) = Isvt! [by @) ao [ey O] odhus, lt(uj+divy

O odo prove . SAT = P Sup pose sat # #& Shen , Ve ESAT OM Mayer MED Mp Mpa a Ramittonian cycle in a, . Q Contradiction bo ‘our ascsumiphron 5 aay ‘pa? Lp Shai Yi te | “,SNT=O, 40 hak [SAT] =0 lsuTl = }Sl+151 —>@ Again by Ae defcniteton of S and T, dtu)= IS] and AW) = ITI ve A(wW+ d(v) = Isl ITI = \sut|> [by @) *P (oy 5) | Thurs, d(uj+div)

| © scanned with OKEN Scannervoubgraph of Gt, dence , A(uy > dy, (Ww ana aA’) > An (v) wheve du) and dv) denote degrecs ef u and v ka Go Bencee , Lan © => dlusd@ws dy (+d, Cv) ° , r = Me ut, A (u)+d(v) > p Hence, by Ure alefp ons wand» must be adjacent an A, This oe 0 =Se , Since W and v ore nok adfacent in GO Hence, each az > an edge: Of Go 4 we. can prove, thak: zach YF Hence , G, = Ge Conus, €(G) to unique and’ Renee as well - defined SEhtoxem | 6.9 Cw graph a» hamiltonian df ths Aosuve 2s hamitontan Proof * H00f J © scanned with OKEN Scannerfee ne 2 be. Cae | Seq s Cages added to G in obtaining cle) Lee Gy, Garey Gm = CCG) be Me Auceesstve graphs obtained - | we donow that, G ds hamiltonian “hy Geuv ks Ramiltonian GG te Raméilbonian E> G, & Aamidbonian | SG, & Aamiltonean <> Gn =c(G@) %» Aamiltonian . Grollar tek G bea graph with akleask 3 points - oF c(G) 6s Compleke , then G is Aamelbonian . Peo. | Given, aA wea graph wath atleast | 3 porns and c(G) ts complete | - €(@) Was akleast 3 potaks | ana as p-12 P/> . | “BY aes theorem, c(@) > >| © scanned with OKEN Scanner— Aametbonian | We denow that , Gi tx hamiltonian Uf | €(@) #6 Aameltonean Hence G ks Kamilbonéan | oheovem | 5.10 Dp ~ | Chavekals — ofheovem) Skokemene * ‘het G boa graph wrth deg vee Aequence (dy,do,.--,Ap) » where d4d,2... &dp Ond p23. Suppase that for every value of 1M tess than = Ckher Aw>m oF Ap-m =p-m (cheve Ao no value ef m tess han £ fpr whith adyn=m™ and Ap-m M OF dpi, = p-m ji © scanned with OKEN Scanner° . 70 prove : Gk Bamilbrntan . tue know thak, Gi t» Hhamileontan af | e(@) &s complete. ‘ dence, &E S enough bo prove thay | i c(G1) %s Complete - Suppose c(i) ws nok complete Now, tb us denote the degree of Q vevkex vw un ¢(6) by aw | kee wand v be bwo non- adyacent verxtices Sn C(G) with d’uye AW) 3s sand. A(uj+ ali) as Aarge as possible . tt diuy=m —5@ Sinue no bwo non- adjacent potnts un CG) can have clegvee 4um Po mow, we have Aud +d/(v) 2p 2. AGS) < pe Aw) = Pom (by @) ve, dz p-m —s@ Now, tee S denote the Sek et Verkiees to VK §vy whtch ave nok © scanned with OKEN Scanneradjacent bo vo oun CCG) . tek T denoke the Sek of verevces | * ° BY . pV Ae which dard nok adjacent bo uw Cia aad » ISl= pa Aw) — 3 @ | and |tl= P-1= atu) © ] | Also, by He chovce et U and v | Catch verexn & S has eared ~ | hemosk Aw) and Lach verte 2% TUALY hos vee akmost Aly) > Pubes : fe Wteeng cap @ in 2qP @ we get, ISLS Pot (Pm) Er ate p ol2® = p-i-pim ~A(W)> ~ (pny | =m-'! “ue WS) sme) ddence Sl em CU) Aas akleast m poivks vee keds than or equal kom with ag L3@ | Putcing 2qp @ fn agp @ , we gees | It] & p-t-m™ Since , each Vertex An TUhuy Das A © scanned with OKEN Scanner| | vee < A CN)-, 16CG) has akheasl - | Vertices of ‘deguee = Aw) > Hence, 16 (01) Pas akhease p-m | verktces of degnee < pom i> @ | 8 ~~ dp m4p-m -—— > 50, from 2qn ®, we get , 4,,=m —s@ | Siu, G@ te a Apannin fubgraph | ef c(G) , degree of each potnk an a Cannock 2xceed Mak € 6G) 4p, Hee, eqn and @ Hold tn the Case & G also. ' an | © scanned with OKEN Scanner. q | hin Gi- E(e) nist be a bpanning sd Aubg raph of degree 1 : We Anow that, a4 regular spanning subgraph 9 cle gree 1 ws called a \- bo ac y ne Ark Us Aecarch 4, alt \— factors Xn Gt and. Show that none 4 them averse cuk ef a hamiloontain cycle of a Case (i) : Considevy He Subset > Aa ta, 2b,ae,de sel, ef the. eclge adel of G | Cheavtly, A 2 a i= factor of Gi oe. hmhLhUD ec cles and cence vs nok a danitlbnian Cyl. ob Gt. ‘ Case (i) * Jt the. 1- factor Contains fees edges | from A, then the oe dine passing | Ehvough the vemaining bo points | muse abso be wncluded en ‘Is factor , oo Lhak we again a but an che ' A. Cage (ith : a © scanned with OKEN ScannerBe ~*~ | Jt he Ub factor conkains fuse reg | edges 4rom A, then buo Auch holes | Can be made ! Subcase dipA : dit te \- factor Contains 14, 2b and 3c . : Now, the ‘subgraph dnduced by Ge | Hemeaenin ux poinks ws a path wilh aa points » whose wikgie l= factor as had seh . ae Thus, He 1~ fackor ef Gi Considered becomes A } - bubcase (iia : | det the I~ fockor contains | la, ab and 4d . Here again the remaining + points dnduce By» whose unique 1 acho is fae, Sey. | edhuss, Ue I~ factor of G Considered | becomes A - Case (iv)! Sf He it~ factor contains just bo | © scanned with OKEN Scanneredges fpom AL then again tuo 4uch Chetees are possthle ‘ bubcaso (WA : die Re 1- packer Contains 1a and 2b. In the Sabgaaph uncluced by the aca Aix ‘potaks » point d Ares olegree 1 and thence any I~ fackow of at eegerh Musk -Contatn Ete edge 4d. aN ¢ Tdhus, Case (iti) ws Hepeated - ey Eubecase (v)B dat he iH face contains Sn the Aubgraph tnduced by the 6 poinks , point 2 has ta and 3c. ceematnin Atgree 1 and ence \~ factor ot hak » vaph muse Contatn maa om 2b od Cy ae = a ; \. 7 Tihs Case (lil) Ss sepoaked . Case (Vv)! tek the 1- factor conktatns gust 1 ed 4 A, la 2 t vt One move edge from St de Conearns : © scanned with OKEN Scanner° _ A, then one of the tarvktey Cases | | | wit be mepeated | Wenee , we Rave to Choose the, other fpr eaqes ef Wis. t- actor dyrom kvo paths , aach of Length 3B! uc, Tom’ Cobd and 2345 i Henee , the 1- factor ad Ls, | B= fla. co, bd, aa4eh mye. Zs | Now, G-B aS agaxn a unton of | bwo Agetoinke cyoles and nok a | Case M).* } Suppose there extsks thak dows nok contain any edge a- r= fackow \ om A | | odhin , uk Can Conon akmost | bye om he cyte 123.451 akmoske kwo edges frown the cy acebda i qunce, ve Can Contain Aakmosk “four cages and {a © scanned with OKEN Scannerence, Urere loos nok extSk such | o 1-fackor : | Since the above Sin Cases Cover alk posseble Eypes ef 1-fackors , ave Se that G has no 1- factor arising "Duk of a hamiltonian cqele Hina, G has no Ramileontan by cle - Thus, the Peterson grep G is , non ~ hamilkonian . 3) Tiind c(&) ter he following graphs " WN » 4) %Find the closure of on +x and K,-% Trees | | A roph that contatns no cycles ae | cabled an acyclic graph A connected acyclic graph as called / © Scanned with OKEN Scannerba bee | Forest . | any graph twrthouk cles 14° also Called a forest <0. thak Me lomponents | Of a forest ave. broes + | ‘Example : : : a FOV AN Forest © Aheorem > 6.1 eer graph . othen Be plowing dtakemente ave equivalent . ) () G@ an a bree (i) “Every tuo points of Ge are joined by | a untae path (iil) G is connected and pa=gti. ™ G i» aoyclte and paar. | Proof : ; . | Given hak & be a '(p.q) graph. = © scanned with OKEN Scannerdo prove =) =>(i1) => UN) iv) Sy) dy Sh: Assume Mat Go 2. a bee do prove. “Every btwo porns of Gt ave gored by a Unique path Since G us a bee, Gb a Connected aopelte araph tee Wi abe yy bwo poents of G. Since G ts connected , Here endsts Qa w-v Poth vn ' Now, we Aave to prove, thak Ue ey | Poth 2s unique ; r Suppose ere extsrs luo déstinck U-V paths | P2 We VOM IVE po Nn = Ond Pz ius Wo, Wa, soy Wom = V tee tobe the Least, positive tntoge | euch thoi lziem and ur7d P, -(Guch an 2 onteks = benee PR and Po ave Aévstinck) EeRAR (dence » Wig | Lak’ J be, Me feast, positive Le hake tejem and | integer Auth A | wre. i © scanned with OKEN Scanner| then, Ere tu oy path along P, followed by the wy wi, path Along P, forma cle , which ww a@ => => | Since G te acy elie ; Hence, Urerve enisk a untqie U-v Path un G . Cihus, every buo points ef G are | Joined by a Uncgque path .- : | @) => Wh: Assume that every tuo pokns of G are jokned ba a wg. path Ode prove : Gi be connected and p=qti Since every avo ports of GO are joired by a pakh, Gt Se Connected. Now, we rove bo prove hak p=qrtl- - We. prove Bis by anduckion on P- Tohe Hesulk do beivial for a | Connected graph wekh one or luo poles Assume thak the susulk te true | fer qrophs with fower than p | points . = © scanned with OKEN ScannerFo prove the sesulk ts Ere for graph with Pp potnks hee G bo a graph wath p points . det x=Uw be any Lene of Gi . Ginte Here eatsts a unique u-v pach aa Gi, Gx» wa Akt tonnectod © | graph auth emcee two Components G, and G, . : graph tik G, be a (Piv4)ond Ga be 0 (P: 42) graph J ‘ edhen prP, =P and Utd, = 47! —H~ : assumpeion | ae ° |p ncltro bux unduckron = 44+ and B= 4st! : ‘ a p= Pt Pe a arrar bby Ol | . = Or4q,+2 ~ grite (oy 6] ae, paqti § 7 (iy = fy): Assume P= 41° go prove? Gt ws acy elec and p=q-i aera ws connected and 7 © scanned with OKEN ScannerSince pHYytl ww given, we neces to prove oe & cuty lie : de, bo prove , G Contain» no Cycles Suppose Gi Contains a Cycle of length n / oghen ere Ave n° points and, n Lines on this cycle Coie « pote wu on the cle: Considey ony one of Che Femaining P-n pointes noe on the Cycle , say v | Since Gi ts connected » we can find a shortest iv path tanec Consider the Line. on Hits Shor task | pakh Undiatak oF Jthe pon Leones thus obtained ave OW deskinek - | dence, 42 (pendtn = py which (a a= NU atl =P - Thus, GA A> acyclic : Ww) => & | issue thak Gv, acyclic and = © scanned with OKEN Scannerp=qt- Odo prove Gi ty a beoe Sen G ue a clec , bo prove pe [a bee we mudi only te prove tha 1G a 2, connected | Suppose & 2, wok Connected dee Gy, Ga). --7 Oe (22) be He | Componenes of G Since GA KS a clic , wach ef ee Components us a eet Hence, Qrth= pr where Git Ce (Pr4i) graph a os (a+) = ZF 71 ° ree Oe and ke? , | | cs | rwheth we & >—_ . | Hence GA te connecvod . Cy | hus, @ te o roe od | Corollary : every yon - baveal bron G Pas Aklease Wo vewskxces - © scanned with OKEN ScannerStace G fe none bvdal Atv =! for all potnts Vv » Since G & a bree » we know hak P= Yt! Y= P-1 —®D Now , 2 dy) = 24 ° 2 =a(p-) [by o] AL ZdWv) = Sp-2 Hence , div) =1 4pr Takleast™ buo VOrVERLS . @ Theorem + b6.2 | every connected graph tas a | Spanning bree . Proof : | dee G be a connected graph | det T be a minimal connecked “spanning subgraph of Gi . | nun, er enh Re mm vet 7 , | T-% us dtsconnecked’. >| © scanned with OKEN ScannerHence , x dm a bridge of Ts 2 ge Acyehic dlso, T us Connected Hence, Tw a tree Cds, eed connected graph Aras Ga Apanning bos Covolla: ae kek G bo a (pa) graph . Then q=p-' Poof : Given thak G x a (pq) Connected graph . Since G is a connected graph, G Ras a “dpanning levee , Say The. ; Che number a Leones Ln T oe pri: [te ws a bree | peat Now, number ef Renes in G Nites “of dines 440 TT =Pp-l. Ab, y= Po! = oHheovem : 6.3 Ft. hl panning tree of a © scanned with OKEN Scanner a| deck x=uv be an | Connected graph G. edge ek G nok *1 T. Gthen T+x | conkatns a unique cycle | Poof, : | Given hak T be a panning tree | ef a Connected graph G and x=uv be an edge of Gt nok an T. 750 prove,: T+x Contains a unique Since ae a bate Anil de, clog elie Since T ts dog elie. 7 avery Sets ano | To Musk contain x ° Hence, Creve orbsks a one -toione | correspondence bebueen Co ches an Tot band u-v paths fn Toa tuo | Sinue Tt> a bree. | oe pokes | of T ave foie by a! unique pak: | Thus, herve 2s a Untque U-v | path an oT. | dni, uve vs a mint ge cycle | | ° wn THO © scanned with OKEN Scannerere ef a bee Definition s : kee V be a_ poknt An “connected graph Ga. ine eecontricdhy e(v) f V & dafined by atv) = max dtu, wD) we. VIG - CThe vadius x(t) w > dopined. by 7(G) = nein Forw/ve vay Vv 4% called a central poink, h | emM= re) - | wave isi ot central potas de | Called he Cente - 4 G | cen | | | | | | | | euyjy= 3 e(u2) =2 (us) = 2 2 (uy) =23 eug) = 3 etry =3 (Aa) = 2 Sthe centwoal poinks Ara Up and us Conve of a= hus, usy a | © scanned with OKEN ScannerVY TWheovem :b.+ Every wee has a centre | COnsaS Le ° | of other one pork nt oy two acy Acenb poets Pacof ‘ che mesule ds obveous pr he bree kK, and ky Now, ut T be” any tree with P22 poinks : oN ia gthen ,T tas aklease wo end | points and maximum dostanc fom o geen poink u to - other pointe | cceurs only when v de an end point. | Now, delete oll Ue end poinks Ayer potnk kn 1! ds 2nack | ecconbert etky ° the -Bame porne un | dene, T and a’ Bove the Sant Cenlore - . 4} the process of removing a — © scanned with OKEN Scanner° points As ve peated , we obtatn | Auceessive booe hawing Une some Cenaes AS T and We eventu Obtatn a ee which te either K, or & | ence, the Cenbve of TT Consxsts et | eithey one point oy bwo adjacent potnts PHoblenu : | Qetermine Me conbve each cs he | bees given below . aS YY | q, Gu Ge Ge © scanned with OKEN Scanner