UNG Zs Beguce Sequences A partition ef a won negate ve snkege, nhs oa fxnete Ack of non - negative integers d,,d,,.. ydp whose Aum won. We dincke this partition by (A, ,d2,+-- dp). Ate G be a (eq) graph . She partition aq ab Khe Sum a the degrees of Abs poines is called the Porketion or tye degree Aequente of te Graph Ga. A portitéon P= (dida,..., dp) of 1 ONE De ipovbe ed Ly be a qrophecal partition oy a graphic sequence if theve oantsks a raph & Whose potnks have ce grec Ae and & ws colled a realization ot | oHoy example, the partiiion P= (21,9 4, four ws graphical and 4 © scanned with OKEN Scanner| Kyo ws the witque 2 | Remarles : | he tame partectcon sualtzation of P /\ Va |) dingy kwo Asomorphic graphs Ackow mine » However » Hae | Converse B nok brug “4 G G, and G, are Asomor phic graphs deftneal by the Ksomorphesmn f(us) eve. Thits partition is We Wy We Ws im GQ, Ws G, and G, ave graphs . Bue Burey Ga,2,3a1,1) 3) du partiteon Ws graphe cal , hen (apa pe i a P-1 fpr each i. | However, ese (2, 3,3,3)° G, non - Xsomorphte Porktencon As Gida,..-,dp) fn on ts even and uo conde tons © scanned with OKEN Scanner| Oe nok Auffcetent fpr a partition’ | bo be graphical Hor acne » the partition (23,3) 1% 10 as nok graphical | Pucblem : ) Show that the pavkikLon Pz (1/b,5,4,3,2) “ws nok graphic : Proof ; Suppose P rs gqraphte : dt & be a sealizat’on 4 Then G& has 6 potnts . Hence, he moaotmum degree of-any poink in G de 6. But in P, the mootmum degree ds 7 dence , P te nob graphic 3) Show thake the paveitton P= 6,6,5,4,43,1) ks nok grophic | Puoo. Given Wak P= (6,6,5,4, 33,9 Suppose P ae graphic dee & bea Healksat’on of fp. Then G Ao» 7 points © scanned with OKEN Scanner| ene the maswmun degree ef ony porte an G ks b | eve . 2 -potnks % Gt Aave cleg vee b. | . These vo points awe adjacent: | wucth every other potnt ef G Hence, Hu degree of cach verlkern ao Gs | @= aklease 2 40 that Gi has no poirvt of degeoe 1, which bs 04 SS ¥ Phe Ch graphic : “3) Show that. the partition P= (os,4,22,1) 24 noe graphical . Given hak Pa (1, 5,4, 2, 2,1) Suppose -P ty graphical : het G bea vealisation oP, Thin G hos 74 pecnes . Hence, He marin degree of any pone Yn G ks 6 ~ Here Dee as a potwte “of degree 7, which ws a " Convadt ckion | PIL DP as nok anapies | Graphite’ Aequences) | Note » If§ Aiidas.w ee © scanned with OKEN Scanner dp, are the degvecs OfHue poknts Wi)Vo,+-7 YP vies pectivoly of a graph G and Ue poknk \ of “deguec d, ws adjacent to the points Yaaro Ya + Phen, the cbegree Sequence of the port deleted Subg raph Gi-v, ts given by (Aa-1, da-1, 2 Agar? Ay a7 Ap) ® Theorem : 3.1 S A partition P= (di,dz,.., dp) of on even Number «nto p portks with PRla.d,2d,>,....> dp us graphecal “ff the modif ted pastation [- etd ty dg oI C Aa gg ueee, de) ds graphical }3) Peoof Given thak PL (dijda,..., dp) with | P12dad,>-.. dp’ Assume hole Pa (d,-1, ds-1, — | Ca Ag as 7a e dp)... as graphical: Fo prove: P= (dijda,..., dp) ws graphical : Since Pl Xs graphical Ph hab a , a mee 1| wealisation | tet Gi be Me seatisation of | Wath verkou see Bo Vay ee ¥PY ae | that asin aol, divs) = dg-1,--> A (vp) = y kik G be the graph obtained from G’ by ‘Adding a new vertex v, and madeing AE ada cent bo! Va NB Vay + Clearly , he partition of G ks P and ence Pisa graphic. Pmequen ce” Convers, , assume hak he pareition P= (dirda,.-ydp) ve graphical . %o prove > The parection | P= Gate ds-t, da yi tt tage yt 2 Ze) us graphical : Since P ws graphical ,P har | tueabisatsion heck Gt = (vx) bea realisation oF Pp hak Ve hv vay.) Ve¥ with dag vind: Sh vi ds adfacent bo Va,Va,.-, Vari / Uren G-v, us a sealisation of of Sk the graph G@ does. not. have bs © scanned with OKEN Scannerpropery , we well Show Mak from G we Can conmstuck anothes veallsatioy, 4 P init thts property . Bence , assume Wak v, %» nok dye cere bo all vewkkces Va, Vay ie Vat CThen, there eatsts hwo vevtins Vi and ve uch that a: >dy and: v, ds adsacent bo vy bute nol adjacent twekh ve Since, dirdj , there anisks a veveex Ye Auth hak vz ds adfacent with ve but not adjacent with vj? tit G! be He graph obtained from G by deliting the Lines VWNjrYiMe © and by adding the Lines Myvi and WiMie * . : Clroxkiy , G' dn olso a stealisateon oH Pon whith v, 4% adjacent with Ve bu nek with vy oy aupeakivig Chis process we obbain a realisation of Psp rhich Vie adjacent Go Va Nay ee M+) © scanned with OKEN ScannerBenee khe Meorem wes proved | | igor ttm fpr detormining Are Pre» | the given paskteion P ts saphical hand to obta& a graph G realiaing P wher LE ds qraphecal | fee P= (d,do,..., dp) be | parkitton ef an e2ven Ante ger wrth P-ri=d,sd,>... =dp- P is graphical ath the Apllowing | procedure sesulhs fn a parbikcort with every Aumwmand °x graphical ‘ 1 Realisation oF P, 7SAN © scanned with OKEN Scanner© Gitte, P= (76,54, 33,2) AeboG be wa eg bisatcor a P Fron |G Dh ovis’ he palines P Hence, Me masimem sieves of ay point tn G as b. Bue xn P, Tas Re maximum ‘Pas nok graphical . @ Gien; Ps (4,232,111) The modified pavkxtcon | P’= (2,1,0,0,1) . 4 Tthe sHueordered povertion , = (2,1,1, 0,0) Since iP! ‘ip grpphicad .» Pde | graphical . | Partition 6 P, | Partitcon ° a | iS Ral 4 © scanned with OKEN Scanner(eC) Given, P= (5,4, 3, 2,3,3) The mocifced parkeéefon , , Pos (2,2, 2, 2,2) =P, ohhe modified partition _ Pp’. Gy, 2,2) Sthe seoxdered parkrtion Pa = (2,200) Che modved Pareetéion , pM (051) TThe Pordered — Pparkik£on : Pa = (,1,0) Since Ps us qrophical , P aes Graphical . - Paxtétion of Pa Je | [s3, sotatug | Pax tekcon oF Py ‘ Powtiteon of Fe. © scanned with OKEN ScannerPaytitéon of P: KK VA G-) Tuowem : 3.2 ' Y I a partition P= (diida,.., ap) with A> dd... Ap outs graphical , ten = di ws even and Se dbs kk) + DS i=! eS nin hk drh for rakep.. i= ket Puoo we / Given, Ue partition Pa (disden-r) Wet d= d=: =dp a> graphical - hike G=(v,x) be a sealisation of ? with Ve |Mve,...-%ey and degvi di’ We know thak_ Z din, wlch we =I even - k Now, he bum aa: use khe AUM | of He Anqrees of he points | MpVepeer, Me * $e can be AdNeded itnko poy © scanned with OKEN Scanner 2| he SE part ae conti bution to | Uhl> Aum by Aines jorrin g the potnt, | WiyW2 pee Me Ine and pave being Conerrbutston to [due Aum by tres jorren one of thre | POMES Vig Vega ys yp Vp with points of; Ke det AMeVars yr VG - : Ceardy , he SF pave 4s = Kelle~1) and | Me ond part Mos a & min fk, did... fak+! Hence’, dre ket E min hedey =| Toke+) Connectednes es Walks , Wrath, and, Paths | Bon : (Wok) / Walle a a graph G te an | alke-wsn ots a d | ° x Aegaer ce ef potmes et | tines Vo, Hi, 1 a, Va, Ao pore Manns Ann > | begenning and 'énding' with points 4uth thak sath Are “ne is enetoen with ve, and ve | We 2 hak the walk fore Vo and Vn and vb ws called ai Vo-Yn | a 4 © scanned with OKEN Scanner= Vows Called ‘he initial point Ong (Va ds calteel te bowmin al pote of | he walle The above walle us. also’ denoted by Mooi, Vah bu dy n & the Lenes of re | | walle being et evident. . Keng th of re walle Tthe munber of Lines sin | the walk (called the Length of He wall» A single, pointe as Considered ae @ | Walle of Aungth Zero . | | — | A wale wy called a bral if all dks Lines ave distinct . | Path - : ; oo A walle bs called a Da all the points are diskinck . : ie | tx ample * MI V5 iV, View. 3 © scanned with OKEN Scanner| Gn Gy Wyo Va,Va Vo Mi Va Ve le | walle . | Mi No, “4 V3, Va ,Ve us a rath bub hot a path Wp Va,V4a,Ve Us a path , | 1 | | | | Result : |) Every Pah 2s a teath and tratl ned nok be a path (2) Shhe graph Consiis ten ef a path with jn potnks ae) denotod ty Phe: | Closed walle! | A Vvo-Vn Wolle 2s called closed’ “f Vol'= Vn: Loos 7 ‘ucke = Vo A closed walk VoMiv,,). Ne da which We 3° and Verna. Nan | ane Adtince Rs called a cycle of dengith,, h 1 7the gra consisting a, cycke of lenges nds daenoktod by Cr: Oy te Oy. erfangle AN © scanned with OKEN ScannerCéhrovem +4.) | In a qroph Gr, amy u-v walle Conkatne a UV path ‘ Pucof ; (ue prove LA. (ves by Xnduckion on the dength of tre walk - Any walle of dength zorro 0: is Obvious a path . Now, assume hak the suse bs rut fpr au walls of dengeh en Fo prove : Tdhe sesull jks, rue © for alt walle of dongth Wo. Ack We Ue Wi Yay ssn =V be a. Uv wale of Length mo J au Ue points ef the walk. Ou ddistinck , then Aeon he, of a path . ay Yoniteb St not , herve wxtcks is ahd j 2 Auch. hak oetey ein and use: Now, U= Ue,U1,U2 >+> POM lpg On” Us a wu-v wall of, Aangth 2V, Which contains a u-v path by ou © scanned with OKEN Scanner| Xncluckton assumption . Hence , gnu wall contains a | U-v path : | Ttheovem | 4.2 Sh 62k, then G nas a path Ff, dength de. | Proof i Given S =k Wo prove : G& Mas a path ef den gth &. dot Vv, be an. avbikrary poenk Choose V, adjacent to v, - Since SS , there 2rists atleast k-1 verkices. othew Man Ww which ave facent b> \, - Choose V3F#v,-, Such iak Va as Pacenke bo igus : Sn gerdeat 5 drow. choosen WiNars VF Wore \eteS , herve 2rxtsks aA point 1 vst Mp Vel piv VP Auch hak Vi4) vs © scanned with OKEN ScannerSheovem 14.3 7 A closed walk ef odd Aengh Conkain, a ck . ; Proof : i. Devo ne bee Closed walle of odd Aength : Ane n>3° bn Me walk Aksolt wo the Cycle Cs, Ren ce re stesulle 44 ae Now, assume hak We sesulk i bruce Pr oll walls a dength pri, whith A> @ =>— bo & has p potnts. Bence, G ws Connected & ¢heowim AR “A graph G is connected Ag fer any Paxtitvon Vio aknko Aubseks Vv, and V., theve ts a‘ Line of Gr gorning a posnt % V, bo a poxnt of Vo : Phoof : Assume that Gi ts connected 2 ie eo prove . Otow any partition ot V wnto 4ubsets Vand Vv, » Unve isa Hine of G forming ao poink ef Vv, ko pornk et Ve YW dik Ve YUV, bea pavettfon V snto buo 4ubsebs . 2 dee uev, and vev, Since, G ke Connected . Herve 2USES a U-v path fn & , bay Us Ve Nip Nev | tee © be he Least posttive enbeger auch hak VWIEV, » Auch an Tt enisks Sinte Yn=VEN, | Then, Ve, EV, and vty, Vi ave | tay Mi adfacen & ; © scanned with OKEN ScannerThus, there dn a Ane Jokning - Vi_tEV, and Vrev, . Conversely assume thak , for any parterefon V unto Aubsebs \ and v,, ture £5 a oline of G forning 4 point ef Vi be a potnt ef Vs “ To prove: & 4s connected . Suppose G 2& nok Connected CThin, G cntatns atleask two Gmponents . vdtt VY denote Me Set oF a points an one comporank-. and V, denoke the Ack ef alt rere An; another Component. Cearhy , v = VU, Buk, there ks no Bre forning- any Pore Gs Vv, b ony portne ef. Nac Whith An a ss bo’ our assumpbeon : Henze, G do ‘connectod dhiorem : A 6 HG ts nok connected , hens; we Connected : Sv v ’ Povcof, ° : 3 st © scanned with OKEN ScannerwWsesume hat G As nok connected . odo prove’: G ws Connected . Since G ts not Connected, G Aas more than one component deb WV be any tuo. points ef Ga. | Then u,v ave any uo poanks of G | also . we well prove Hat. there ts a u-v path in Gt J4 uv belong to cLiffavent Components in Gt, are not adfacent in G& .- Bene , Fey are dpa cent an Cr Sf uv tie In the same Component. , Choose W ma afferent: cpenpohenFut Then wwvV wk a u-v path in Hence, G Us.connected . 4 | | | Bebini kxon : | TFow | ony bue> patiks , u,v ef a graph we one the apron bebveen wand th of a Shortest | Yb Alu, v os | 7 ) lode 7a a such a path rests 06 Otherwise 4 © scanned with OKEN Scanner| Nok: | SE G@ 6 a connected graph d(u,v) ts clvays a.non= negee a ow Sn Units case, d vis actually. a metric on the et Of points Vv. Sthiorvem : 4.7 wt graph. Gi: with atleast bwo Points bipar btke bf AW LK cycles axe ,even Len . ©» State and prove . the necessary “and aubfpectentk tond2bion 4p. } * graph G with kwo pours ae biparkite oN = ( Je OS oo fier any Dun Assume Mak ‘ia graph "Gt with atekeast buco points ws bipartite. | GJo prove: Atk pes cycles ave fe, even den 4 o) , Sina , GO rs Beoae as 7 \ can >be partitioned into lwo subsets Vy, ands Auch that every Ling joins a point of | 1 y, bo a point of V, | | © scanned with OKEN ScannerNow, Att Vo, v,,V2, cy ele ef teng bh vn Suppose Ve EV, bhi » V2, Va Vere) eV, and | | WMarVe,.-. E Va>* | Vn = Yo be a Otuythey , W=Voe Vi Hence. n ts leven Conversely , assume Hhak atl cycles ave Go ave % even ‘Lent : Wo prove 2 Gt Ae bipartite : A, bo prove ; Vv can’ be sporttktioned anko luo 4ubsets” Mv, and, Vz. *uch that every Line gu On» pesataatt v, be a” pointe % A 5 7 Withowe Ros ofr generat . we man assume | hiak' & | A> connectad . : tik vi eV » a : Depine We AYBN /divw) D> avant, | NV = fvev JAW uy he odd, | Clearky Vav,' =p and Uv. = il Bene | Vv can be partitioned ine Guo vaubnebeb My, and’ VS ; ; Now, we rave bo prove hak’ ‘avevy) Hine of G joins o poank ef Vv, bw 4 © scanned with OKEN Scannerpotnt of Vy ~ Suppose, lwo points wy eM Mond | eee : \ Coxe | kek P be a horkask Y- uw path “eh length m and Qi be a shevbest v-v path of den ath n, } Since , wae V, > both m andin One even . 3 Now, Le u, oe the Lage pene Common bo Prand @ Thin , the V,-=U, “path, along, P and >the Vin Uy, Path along . Q are , both shortest paths a aeons, Hove the tame dung th, say t ; . Now, the “uy-u path along Py che Hine uv followed by the, van, path. along Q term a cycle Youu The Aingth fof his loyele = (mei) +1 thot) vr oe mtheatti which ws odd pete tea contradlickxon ‘ko oun | assumparon thot al jog cles One Gr | oven Aangth ; No buo, posnts of, vy ova! ada tent 4 © scanned with OKEN Scannerne we can preve that no kuo pokn ks 6} Vv, are ackyacent dence, every Lene joe a pointe ov, bo a porn of Vv, ‘Henee, Gi is bipartite Dopeatecon : (Cue point) 1 (Cut poine uA “tuk point ek a araph pointe of a graph Gr ko a pount » whase Herroval tneveases he number of ode vd emer a: ey Onéd. nid f bataige 4.6 5 aph Gt a ne, whose < HEM OYE deveases the number St Componint.s indoq Sy Noke - ) Carty i ahaday & Ook pane of 4 Connected graph, Sh + , then G-» As Asconnecte al &) Sf x Xe a brtd of a connected greph Go en G-x & Atsconnicted . “ 1 Oo anag od Y nample * ) Na on? VEY Hy Ay ‘ 4 4 oy 44 V4 ey, ops 5 Gi 4 © scanned with OKEN Scannerdn G , 8, 2 a Cue poknk , Hy © meg? : atk Vo be a ~ potnk of connecked grorh Gi. When, re de culaa Atakemints ave equivalent (i) bibs a cue potnk of G Be diy CHhure ernisks a paveceton’ ofl, VASY - into 'Aubsets U and W Buth Lege at? dpe cach UEU and WeW . the poink vt» on covery u-wW path a (iy here entsks buo poinks (ui and w clés kinck from v Auch Vaal wth on” by ad akh. evevs U-wWw Pp al Lis 3 _ Peony: _ : Given thak VY be a Point: | ob & a Connected graph a. ee ( => (ity . Assume hat V je a tk pornk a To prove « Where otis a pawkiletor , 4 © scanned with OKEN ScannerV- hey tate -subsols: U ancl W such that | fo each wWweEV and wew., the point Vis on every th-ty path Siiee Vide a crt pote Of Gi, Gav us Aesconnected G-v Nas atleast buo Components Ace U be the wsek of, potnks of, one af the Components ef G-Vviand W_ be the Ace et memetneng potaks of G-¥ Cardy; Vohty= UUW de 4 partetkeon ot v= fvy dee UuEUV ard wew . it Then ,uland w Le sn a Componsinkcs of G-v - 5 Hence, Cueye is no UrwW path Bo GA. | Every Uu-w path an G& Conkatns © - (iy > op) (Cts Ro bxtvtal ay => ©) } Aba ile Wak Uere prcsts vo points rand w adseenck por bk Such, hat —Y bs on “every Swe »pdch we al Ck pore of 6 “Jo prove’: U- WwW path an Gi, | Sfnce VW 4s on every | | | @ Scanned with OKEN ScannerUnw t no u-w path an Gav. Hence, GV we nok uonnected Wd a Cub podnt ef G-, Aet x be a Aone oh a connected graph G Thin Ue fetlowin Seatimenks are 2qeA valent (x & ws a brvelge ef Ga. / : (i) dheve exists a partition No dnko bo Subsets U and W, such hate Apr every Poxne ueU and wew, he Line 4s on very tw path . ‘ae : (QU) Chere cutsts tuo posits | Ww Auch hae the Lire x us OM every uw, path - 1 V 2 Zaheoren | AAO va J t A Line x of a tonite? graph Gu bs O° G& a mee Ath me as hot on: “eg ae ct Geer i Ascume hak 2% dea betdge oh Me Connecked graph &. 7) ce (TD do prove TR Aes nok s ons Of ge S ose ‘Ytow, 1On, a eyes c of uP P' b hie Ww, and Ww, be Ange two, poets rm ? . avd ty , . fa Gt? j A © scanned with OKEN ScannerSkate Go is Connected » there extebe a ww, path Pan G. Sh A as nok on P, then Pd a pokh an G- St xt on P, suplaceng x by Cx, we obtath a w,-w, walk wn G-% Td Wis walle contains | A Wy We path an G-2% : . Hence, G- >t ey ae / vuhieh, a conkradtebfon bo WH Ae a bridge Heace, % te nok on ony HM GQ. . dace Convey Sély’ assume that 1 Ss -net on ony jee of "Do Prove’: ‘s¢ Sa a “baid ge - tee me 7 ‘Wot on ang gele of G Suppose, DL te nok a wbrtdge AL hen Gar, ds, Wonneched .. Mb pet Where, ko a ,U-V path An Gi-% ‘his path bogether with the Bine | A=uyv Jrome a cycle containing x and Oe. Ao Go contradiction | bo mum te nok on x LSJ * on cle — 9 © scanned with OKEN Scannerane Mite oO butdge . YY very noi - we kvetal conne Eked graphs as atlease tuo potnts Which ave ‘nop cuk podtks . Puook : . ‘ or sos: dee G be a non-trivial Connected Graph . Po akle ot deck ud v are, tuo points an & uch that da(wy) ts martin . Jo prove s awand Wave Mot ok poxnts Suppose Vits a Unt point Wher; Gov thas, maye than: , one Componint | er ce Choose LO porn, w aa a eee : rok dens not ,Conkain uu. hen , v Aves on every uU-w path and Banke A(u, w)> Ay) whith wo 4 Conkyadéeion” te Au, ) Ss martini” Hina) vo ds Woe a ‘tuk pornes 4 we can prove, that) Ww re» nok A tue potne — > * Aunu, every non - epee > nove ckeod f + 4 © scanned with OKEN Scannergraph Aas atleast bvo points which Oe nok turk pornks . Beln . (Crevtt Bees (abt). 2 Actined to be edhe Citvth of On gxaph sd té he [Gu Length of iks Shorkest cycle Cov cunafevon ce g The CY eumference a graph a> dopered bo be Ux Aangth a aks Longest cycle yu? Pteblines : |) ind the Gath and Cév cumferen ce ot the qeltouiens graphs . ; D Ka 5) km, n vy ro a iv) ohe Patera graph . () Gow km 2 Givth = 3 Covcumbpvence =m Gly cay Kmyn *: Girth = 4 LE i . Cevcumbyren ce = 6) Kos (iy FFor Cn: Girth =u Coveumnpgren ce = : . Ob “Wy Tfoxr the Peterson _ : Girth = rp, Cex eunperance = 4" © scanned with OKEN Scanner4 wt Connected non-trivial graph having no cut poink ws a block - A block ef a graph as / Aubpraph that 2 a bloue and ks masimal with Yespect bo His property ; cGhiovem 14.12 5. . j Ny, ~ kek &@ be a connected graph wath | Ableast three points Zhen the . followin Akakenunts are equivolent . () @ & a bhoce (ti) ang bwo posnts ef G Le ona (it) any poine and ony Aine 6 & Gn om G4 Common ck . |) any tuo Anes of Given thae G be at ee cteal graph with atleast 2 potnts . ‘ Lie on a Commo? &h > Q) oe Wsesume that G& ws a lolock > 4 © scanned with OKEN Scanner| odo prove 5 iy 2 porns of, a | a conumon Cycle . We shall prove this by tnduckfon on | he olistance aAtwv) between UW and v 4 | hat any buo vertices u andy We one j Common . cycle, . Suppose (uv) = 1 dence, Wand v ave adtacent By cur assumptyon Gogh, andl G has no Cu pornts é Hence, the Pine xo Uv ws inde a” | we Renow that | “f tbe a bridge Jen | % ie note on ong cele i | Sir >A rk» nob a ace yee fe : | dence, the pots u and v We on a [Common oye 4, Gr. é . "he stesulk 28 tre for Alu a) | Now, assume hae the rresule | Us “brue Pe bvo veveaces nw and ve ak a! distance dass than’ He ond.’ 7 | Sto prove, che’ Teste’ £6 * erie for be : © scanned with OKEN ScannerAlwy) =te Ww heve kee Conseder a rr-v path Of Aength de et wo obe the vertex that preecdes Vion Unis path - chen, Aluww) = -e-' - | dence, by our tndurck tor asstumphion Uere orxicts a cycle Cc / that Contacts waned w. : Sie G &.a block » w vs nok a Cut pont. a Gr and Ao G-w ws Conneckod . Bene, tuve .extsts a wv path Po nok contatning We dik v’ be tre Last pornt Common bw Pand Cc. TN f Since » u 4% Common to P and Cc | Auch av’ pursks : Now, Atk Q denote Une ev’ path olong be Cycle C nok Containing cthin , Q fpllowed by the Nev path | | . jalong P, the Adne vw, and the wt 7 © scanned with OKEN Scanner| path along the cycle C fprm 2 cycle | that contatns both wu and v | Hence, u-and v. Lees on a Cy ede . “dng Que. potnks of Ge Le on & Common cycle et Ga. @) > vb a Assume that ang avo points of G Le on a* common ce of G- CJo prove: G ta block we, to prove, G thas no tle Suppose Visca tuk posneé ef a. John, there. ertsks uw and’ w cstincr from VY uch thak every u-w path | Gontatne oy. (@y Therm : 4.8) * Now, by our assumpéton sur and w Ake on a Common: Cycle ond His | detormoncs uo wy paths and ae hone of Urese paths dors not. contain | which 2S & Contradtekion . deter, G Aas no uk points 20 that Gis’ a bhock comniow P oknks Qos My! —_ d © scanned with OKEN Scannertoo =poknts of * : Assume Mak any vo PI G Ake on a) Common ay cle ‘ Cdo prove ° wn pore and “4 Line G dee on a Common OC det ww be a pore and vw bea dene 4 Ga. —_ a: By ouy assumpston UW and J Ate on Q Common cle C xX ; h, J} w Les on (C, Rhen the Line Sin koge he with tie V-w path s 4 Containing u tS) the suequtved tycle tontatning Bk and Ue Line Vw: OL wets noe on C, Ret! C' be a Cy cle container u and we. his apcle oekoxmines buo Wet paths ond atleast - one of these pass does not contain V. Donoke this path by ®P. , : h dee u' be We frase point tommon ko P and C odren, He Mne Vw fpllowed voy wu! Aubpakh of P and the wiv path un € Conkaining uw forum act © scanned with OKEN Scannerayele containing hand the bene vio. Henec , Any poke and any Cine of 6 Ae on & Common cycle (ii) = Cit) Sree any Line ios enekdent wth too ports » thes ks wivial . ay s Oy) wssunw that any porn and ony Line of G Le on a Common. Cycle : [Wo prove : ny bvo dines of G& Lie ona Common cle . dee Ut and vv, be vo Lines ey Cus assumpdion , he pointe uj .and te the wv. £2e on a common cyte e aise, he pont uz, and He thre vive . / ic on a Common Cyle Cc’ - > Now, He Lones” utts and ty-vi path alon ch, tu Line Viva and the Van path’ alenrg C form a Cycle CIhes cle Contains the Ares jl, aNd vu, , , Hence, aung Guo dines ef & Ate Conunon oye z Hence — (ity => (Vy) on a / © scanned with OKEN Scanner° oe o™~ WW) = GD : ° edssume Uhat any tuo Lhes of G We on ai common cy cle Jo prove * ding porn ana ony Ling ef G f& on a common tycle ar Siree, vo Lares A&e ov’ a Common Cycle » the vesulk ds bvtvtal . Hence | diy) => Gin Cohus, we Rave proved that (Zs (ti) _ Gis (il) and (bes) Bence khe given Atakements Oo Lqutvalent . Conneckevil othe vonnectivity K= K(G) % & raph G KS the minimum niember °F posnks whose vermoval wesulls tn & dxkstonnecked’ ox tiveal graph r Bine Gennece Ee : ' : ; dhe Avnet connect Lviy d= A») Ga graph G® ks khe minimum numbt* of Lines whose removal “rogubics int 4 © scanned with OKEN Scanner| désconnected oy kv zal graph or) Zn, KG =2 Cavey ee, AYE 2) Ges Sy : = a Resulks : : t | )) Whe lonnecle eval and Lene connect ity of a AkStonnectod graph ds: evo j &) he Connie cee vicky 2a Conneckod™ graph | With A crt poi ws 1), | 3) MHhe Lene tonnectsvety= ef Q connected | graph with a bridge a> 1 a) Chhe Complete gvaph Kp cannoe oe disconnected by removing any number potnts . Buk the yemoval of Po! potnts suesules fr a beivial graph. Hence, K(Kp) = p-i- | | 8% ec Thorens | 4.13 & | | Ser any graph a, Ke=8., | P00 ; Ao: -prove, }. KAA & " | irse we prove , N= 6. no ’ © scanned with OKEN ScannerSI G Ras tho wees 7» = Sis 0 “ OUcrumese 5 removal of au the Lae, a posnt of mintmuns Acopce ae an a clisconnected gragy Bence | wncedint wath z& .->0O Now, we ave bo prove hak _ Go nee YD . rep Suppose, G x5 1a disconnected or, bivcal graph. Mie. Thin, K=aA =0 Case Case (ii) + 8 pro. ' ly ; Suppose ..Gi > a conntched rank with a butd um 9 | Shen's NS1 a , “ Further kn his Case Gok, or One 4 the posnts dnctdent | ro 2 26 aA Wwe porn , Aenu, K =1 . bh =aAz=I Case tit) : mepase a as a” bonne choid graph with A= © scanned with OKEN Scannerhin, Here extsts r» lores , whose graph removal of rAx1 of these | wna graph Go with a | brtdge Amu. , vemoval Atsconnecks Ure | dence, bhe | } Gres vesults | PIV each o { these A-1 Res § Seleck An nerdy ne pod S| oe potnt lef ferent from othe vemoval ef these A-1 points Femoves all the A~1 Rows . Sf, ttre Fesulttn g graphi ws ales connected then ke | Sp noe, ax 2s aw brfdge of is subgraph and Aence the vremoval of uu ow Vo sesUlES fn a Adconneckod ov Exiviial graph . ne K =r —s@®™ Tdx0m OD and @, we gek — KzAAzS | Rom arse: the Rnequalttses un ctheovern 1 4.12 are often Aeeek . | i Z © scanned with OKEN ScannerConsider the following rer Gr. k=2 A=3 & =4 Hen, KA A 8 Connected At Ab te a block having more than one Line . Aenee, Ky Us he only. block which hs |nob 2- connected . ° taph ds ome- tonneetod | | a Sl muon hak xf G tsa k- connectod graph Since G ds Je- wonnecked , K(GD> k [ptecs AS wef we alae that , Now | ag = Ss deg ve f=! “qe SB dag vy © scanned with OKEN Scannerof) Puove that graph with Puood Suppose Ure ts no 3-connected 7 edges Gt ty a. 3- Connected japh with 7 edges - Shia , G has 7 edges , P2S- ‘Now, we ‘now thae 4 > ee ot wy > 5x3. fi G@ de, 3- connected , | Koa] " 5} bt G has 7 edges . Hounrce, teve 2s no 32 Connected graph wrth 7 edges . A © scanned with OKEN Scanner