Scribd
Upload
1 views34 pages

03 Module-3

so this is also about graph theory and yeah

Uploaded by

wasfiwajiha21
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
1 views34 pages

03 Module-3

so this is also about graph theory and yeah

Uploaded by

wasfiwajiha21
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
| “Theegw es Taeoe | =, cara qb CreC(VE) be a Lovp- fee unde Te gaph G % called a thee Ib aw relator oad contain mo cycles - Lt te usually clemotid —— | me te | % Se 7 QS We obsive Biot eth of Aho Toes abbas “tooo perclamt vesties. A perder qyeilex of a Bee & also a feap. Figuin emailer. the (ophss. Ps te) y / ” . Zp gr — {—* > @ ®&) contains a cyde, Hurofhe tt és not a Ba hore. the Second G& a disconnected graph, 7 Component im Aris Ba Bue Sach oa @) gpagh thot %& a dciscomnecttd gaaph osu e& Comporumt & a Aree is called a ‘phos. Meaty 9 -9- Thedom{: Im a tree, Mere is one amd only one path betwen every par of venices - Then T ina Connected Aimple 9p if path belween every paths between a pain of verhees of T, Me, ue Mee paths will became a cycle amd T be a tree. Thus, betwen every pair of V o Bree Yteag mut exist ona and only ban edges Tedom2: A Aree wilh 7 vores x every te T= (VE) J =lel+ + Pronp: “The parnp is obtained tp opplyog ‘he alterahye “Hon of cmatiemolical to lel. Zp /E|=0, then te >" ceotaked vertex 0% Anton bdew Fee Cord of yo (a) > [O) — eae Iv. SO seins - past (b) amd (c) also veripus tie about . hn Madem 2 Bue fr every tee that ms at met K | cohoaz KO. Now Grader a +t=(V,E) as own m b ~ , © 1 hee [El = K+! (the do 4 \ ~ edge) indicalis frat Aame . ; of the Aue cloesn't appear m 2K a Zh, FA maton, te edge ask end pomls y, 2 2 famoved firm T, we obtain two Aubbucs T,=(Y 5) amd Ty =(Ve, Ex). whee |v) = Iv,) +14) amd Je] 41E2] +1 = IE] Cone of these subtrees caller! could Consist jut a aio verlin | ex , the ual Be ole WwW, % wea nin ee amd 0 $ 1Ex) Sk, U “follows, by the mduchi those tot [e;|+) = ly) Fe C= 12 J Mle N,l + Wel = (e414 (tes) +1 Qy = (jen + G2) 41) KO @, v= lel+l & amd the thadem “follev’ ey alteanahve ‘8m “Trebor 3: FA every TE (y, ©), Ve? fom T has atleast Ano ventices- Proof: Let Ivl= n>2-FRom the above theem woe knew that fal= PS by handshaking propesly 26n-4) = Ie! = Fidegeg) .oSivie T ts Connected, we have deg(y)> | Fa all > Ip T has fewer an Awo pendant verhus then eB, ~Aeg (OD) = 2 fi all vey A oleg (9) =| one veatex vin V. am te fast care coe e ab the Conbadecion DCn-1) = Fg) 2 2I|v)=2n Fou fre Aecond Care we fund Aho Den) = Fy dagey) = I+ 2-1) anolher Confiadschar . | - Exo Let =v, €:) and =O &) be ttso sate Been Ep le =14 amd IW} = SIvi) detiamine \v;| Wel and |e>] Soh) Srnee we have IM = lel+| = 20 | Given Ne)= SIV) =3(20) = 60 | JeyeWl-1=S9 Exq rp anhee hax oro verhees, find the sauna of the veshicos- Sein Here Wi=2020 Tels IvI—l =2019 SO Ry handshaking properly z deo (net) oe 70. Ces leladgtdy - or we => dgtdyt- wet dy = 27-2) = dy =4y= exaia adn wo be GE va nh vertex of 3 too vests of dagroe | amd one veatax of S, ford the number of Leaves in T. Som: dat nN of penolant (Leaves) vertices ftom 4 + Sh) +24 4SxK) = 2(N+4) 42h = 2N+/h => NEO Ex©) In a Bee with Ih Pendant vealices theo of every mye oa eiler 4. S. Show that Me Bue z joon OF dlogree 4 Ord 2 verhices of deproe S. Soln, wet %, be the m0. of verhtes a $ net tt tte => Wht uit S%y = 2024441) 2K, + 8% TIE => % 3, ARP | _o | Ment nected A comected gaaph i, Aatd #0 be minim con nima, nected eet edge ee “Thehem ly. & Connected pi ie, eee ae a Proof: Subpore Gr ts & Cormected graph ere Than G Contains 0 Cyde C. a edge & from Ahis calle cotll mot diosconmeclid . Tesofii2, Gr is mot. rimally entra Thus, rp 0. Conrected graph i a ben tun ti = S oo a conmeclad paph cohith ts ot a cycle ¢. a, pe! 4 Te ‘this wwolll not rmake the roe he aes wanes cl ann wa ere tap 8 me TaN tron amt Tbe, Se a saintly Cconfa posthve . Et) Prove that a Graph = on vets, (n-) edges od Son, Consider a gaaph Gr gohich hi r am 7 verhices, (1-1 amd no Cydas.- Suppose Gite not conneckd . me G@ be We, f= 12,-.K- Tp Hy had 7, veht oe have Wy +Ngt+-- + NEN Sime Gi has 70 Cycles [He's also donot have cycles. en ernie , -6- wir what hae at mn - ed cane Peck. Consequently Tape, As total mumbo’ of edges tm Meee Hib Us (m,-1) + (Ara - .- + CrK—I) = NHK a nal al Hs ain el Soe + that & N-k aN}. Therfcle Ka]. Tue? tal Gr amuat be Canned. Ex) leh F be a Frkest oulth K Compl ). Ip 7 (& the mumber of vertos amd ™m & number of edges im F- PRove that n= m+ Soba Let H,, 42, --- Hp be the ents of F. Since “pach of Mae ira Mae, the number of vertices im Hy amd me & en of edges vin He we as see ae 1g cue R Ths gives Anat mtMyt = oes (n)- jails: + ot (MY) Ss ment: LT k But aah ange amd 1, +M5¢7gt +> += aen-kK Fe N=mM+HK Ex@ Eh eeON c1) be ha a even ass Whee (Ak What ts I! shes seine VG pave Mz leit Ae eee 15/124 l= Gork = 44> Ext) Zh Fiz, Se) BO fied coith Io] = 62 amd 625) ow mony hee ne dlRmined , - Son Given Mo) 762- 2 (G@)ES) => KEM =62-5)51/ | a 7 | Ex ©|Shav that, in a fee, ip the demee of every non- pen- \damt veatex ix x, the Tumboer of veshcas tin fhe Her & even. Son. Let M be the number of veakes ma tee Tof Huse, Lot K be te rember of pendamt vesbices . Thon Ub each mm-perndamt verhbx is clogroe = sum) Of the. dlegroe® of vestionn is Kr Soo) hap equal to 20-1). Thus, | ok SCn-k) = 2(n-) cone ack This. Moos tat mr i2 even. xy Ex(§) In a Bee wih ard vertices, BOR veahiees ane Resve. dagace 4 each, Prove tat 2&8 =A-Z Sen Ona tree ail AS ves. Therefhe At&—' edges votll Be there: Abo degree veahees = AK +444 by facslagabsng Pes = 2I/e = @-() : —s & sete Roquuded amewcer oe > A? 3 'Destance omd Cents rn a Kee The Aree inthe belo hos “Sour verhices . Intuitively , it Aeems that veslex lo is located mae te © they the chor thace veahees . We Shall e caalt oi Yala tind Aen. th Pro. Hae. Masa ends 0 “cerler” (A cordars) . Emhusemt in concept 0¢ a Comber is the cdea of “dulamce", 40 dlpine clstorce bebite age, cam talks Of : oS — s ad b al In a Connected geaph Cr, ce ACY, ¢. Fee tooo of its vealies 1% amd Nia the Le of ta Ancstest fu (Ce, the rave app in te bcten pan) between them - ky Te depiniho Efdbtemee, behoeem any “tupp Yeslin & valid fa. conmacked Graph (mot coaBaauly 2 bee). In & that is mot a Bee, there we , have #0 everal eon a. pair of, Verbices. We the d the 4 eee eo be esol the thar) ig eater. FOL ee Ce.) =) amd Boa. spepuse ACaie)m], 4 @O=%) OO 3 ‘ Sy >t ae | Fa vlence, heme of the paths belweary veshoes ¥, ond vy lin the above Pune ane (a,e), (a,c, #), (b,c,e), (oF), (6,8,) lama (bg, & K)- a2 teoo mndtest paths, (a,c) amd (b,#), each of Longin two. tence d(y, Ve) = 2 A Metaic: Befrte we carr lopitivnately call a “fumchon Ax,4) of 4wo vascaleles o " chtoma” belween Ahan, this e Nonrnegahvity: F0%44)>0 amd Pape act |g. Syrmamelay : fea, 4) = PM, Wc 3. Boamgle crequality : FO (7,2) F(2) Pays condctons ts Called a is Cmmedvatelry evi 4 Stree, A (ve, Yi) & the ke $ jhe shatet pati eon) yeshiees 19, ama bi ag Cammot be amotio palh bet YU, Orn hg? chien goes oO a a4 Mh» Hence AO) Pre Oe pols seled graph Os 0 rabble. ime amote tem eccentaicity (also ‘4p ax associated rwimber L Aeparahon) rp devestex fn a graph. © The eccenbrici E(s) of a verlen v 7 a ie eT Ty fo tha veux at y in@; mt OM) =, THO dey, vc) LA vertex wil mintmimum eccentaicily vin graph G 1s culled a Combe of Gr. Te eccentnicities he fous a wo Et)= 2 mmeer ECO o vents fo seam gh veslix be & Me comer of that : é . \) = ; ov a m S iueateche above tree - “the sede each of te Bin vertins ts Amon next te ake ra two veshees having the mum Se ccoetialy, Heneo this thee awoo - Sorne auuthfis. ropes fo sath Comlaz at bicenters » Pecnute thea cal be pg eccanion fA. ompirson. Tredem st: Een isis ear one KR too comlers. Prosh: Th Siedamee max dv, Ve) ftom a. given vein vy to by ot ven occurs only cohom veslin. Wilh this obsesvahon, let ur ade than Avo verhees . Too] Ahast fs, a teeth ena) cattery veahicos . Delete al 00% ' 7 nu cecerncfies jee 9 has fe The il Aeveal eet bn ae: dhe ccm of fre Siibies: Yarro femaining Pe tees te (te, veshiced Si an fore a veshices Wak 7 had a colar’ oni poner 77 areas Pr et ce cae ton ol ore cates: oni ph as “ri 4 z 2 2 & we et we : © 3 Cent SX Radius, amd Dime! 2 pO Me eh alt Janta on 6G) - mex fet/uev} we lope’ Radius ats the mintrrum eccerhicy fait CO) ~ men fecw/aev} ae | Sponning Tees E Lef Gr be a conneotid _ A Febpaph T of Gr & Caled a npanning tee of Gib G) T iz a Bee ard ) T contains all” verhcer of Gr In ofter wtde a Apanning Bae of a Conneckd Graph i2 a Apanning Aulograph Trot iz alsoa Fee. The spanning Bee te also called a Pee - a eae eee Ae ches. Obviously Y Gr hes rn verhins, ming Pro G must have 1 veahes omd é Ip T wa mM ne a Gr, Man the oh & ah cae Fa a Gy coihawpect #0 T. Target o all chads of & is Oe oeptentet of T in Phas Act ts called The NA “fet A cates ob Tjnrer amd ts deneled by T. Evidently Oe S , : Zh ‘, ts ge? Vy wy K b, Gq + F purty A" Agta te Cormac oh amd only tp ut hana TN : y ' Let G be & Cnneckd Th Gr hes no cycles, . G, és a Pree amd hy ot sporming tel ob, Th tr har cgeles, elk am edge firm ¢ cycle - The pemulting qaayh G' ts Cycle. free, connecléol oma contamns all verhiees. hs gRaph Oc a Apanning Dee of Gi. Thue, G has a Apanning Fine. -[Z- Conversely , Auppore a graph & haz a Aponning Be T. Sine Tia Pee, there exits a path eho, erty pain of venhies in T. Sina T & A Apanning Free, iT containg all veatius of Gr. Thesyphic, tere cs a palh loekweon every pair of veshees tn G- Hence G cs Conmeclad. Tedem2: with resect 40 any of 16 spomni: Bust, 0 Connected grayeh of vr vias nd ep 0% N-! branches amd m-n+) ch&ds. Proof: let G be a cannedked graph iaponal "mm edges omd T be Apannt re any contains all vertices of Gr; it has 1 veshicer. | ,T hae =! Cedges). Thereprie the number’ of edges in Gr motare notin r ts lan —(n-1)- Ts Wreams grad wert T, G hae m-(mr-) choids. Ext) Find ak the rpajmning Bus of the graphs Aron bela ay TINA * 1 Cus| Find onsen, ap shee baamehes amd chads rm Ae Ke graph cotth 7 veahces amd 14 edges Rooted Feos Deb, A dusccted Ban T is called a Aertid tue op | © T contains a unique vealéx, called the Acct chose | Wn—dagree is equal £0 0 and |G. the im " aa aaa ene ae et - \ a . f° Nota Kovtid Sa a oe san ps ane yr ees COHO x» In a tovtid Mee, a verex y 4 3 woilk the outdegtes of = od(rs) =o ig called a Pleab (A Maminal verter). Here u,v, 4,2 amd 1% doaver . All other veshicas ane called baan odes . the vealix 8 in Ahis Acvteol Bee. The palh the at AHS of Length 2. Similasly , x at devel 8, cohereas y has devel number 4. we ca Sa child of 7 amd we call 1» she parent of S. veahees W,Y ond B WL conscdened descendanls 8, n omd%, while S,7 omd A eae called anceshhs ee ALN Red. Se genial “ ove ane vers vy a tovtid Hee avd V, Me. eorestsd Level "rans. ton B i& om omcesth of Vo (A % wa desondant of >, ) i Here 2 a path from wv, 40 VW, Two veatios coh 6 |commun parent arc Acfpered £0 as Siblengs . Subh eg the case foi vealies y amd S, chose parent ce veslixnn Finally 1 9%, ia amy veatex of the Fras, the Aublice at 'V, & Ae Subgiaph mduced by the Aovt amd all of We descendant . Poosts Bee \ A nscted. tue ws called binaay % FA en odes) =0,1,A 2. That ws, th Vhas #wo ns Zp odtv)~0o A 2 FA all VE nm me hue is oled 0 comply OVER : ex wa re ~ | a 7 s /~ a tae The be tee cam be Aapresert a ath a-b ale awe nee Se utd te. bireiy Bade ee algebsaic = cxprasiony (67-0)/5 ) # ((a+e)43) 2 t s b, es EAA & at hovel Rl | Ig | | Fra umdiseclea cornplele. binasy tree bs defied ar a im eohtoh Aere &s one veslix of huso, is of degen one ome Pads Pe and he Nee ve ae at “ & ‘ \ s - vel G Since the veaten beso rdatind ‘fur all san setinn aeer shdiee ves 0%) | Thus every binaay Bee ts a ipsa pas eruhon « 4. The Tumba of bp) on ma comptde binars/ bea (s always odd. “Mes ts ause Mere is &: ore land the ALMainng n-) vearhces ase of odd Tree “fran thediern 4 of graph fady the Tunboer cos of odd degree Wi even, 7-14 ever Hence mez odd. 2 dt age mumbes. of pendant vestieas tn a age tas "ede, the of veshtes Op tsee . Tube, m T equals $ [P+ sen-P-) +2] = hone pe nel Pacblerns ae @), Shoe tal ty nimbee of reali moa biney Tee Find the yw — ¢ mk of Pendent vette’. Yh a. bineny A monpendant vuln in ater ts called am milanal veilon. Lt fellow form equalion p= Tl that the umber of mmtfanal veshices 1 a br Fiee 1s ore les thom the number of perdort veshtes. In a binasy fee a vealex vy, Aadd to be at bevel L;% Ve fy ak os Homce Az fram the Aovt. Thus Ake Rovt cs aso, outcome of the feet ab te Kart Send& do of the Awo vethres at te next evel, 24 Gaz made, ancl &0 or. Raachirg a. Apecipied i g 3 g g g P e : The maximum kvel dinax + of any velian ma binasy Aes ta called the heipht of te See . Tt és do see thot tha minimum "posscble height of am n-v! binary Hee ia amin Linay ~ Log, re F] ohare [rT dlemates tte Arrallt milbgen greater th A equal ton. On dhe otter hamd, do Consfiuct a bin FR a goven 7 éuich that athe —prthust verlen He Poe forvide “fiom Ate foot, we must have ctly Awo vertites at each level, excopt at the 0 bv 5 tran Linen = "ES eQP FA n=l, binary Bees ighng both Mose exRemes are shown Vn the belop; : \_ A, Sy #’ ws? ‘ ¢ > 7 mn ON 2-i] J . or ‘as mar dings = al oS Or a & = + analyses of algdithms ove ane geneaally intrested tn Computing the Awm of te levels of all pendant verre . ee Kmawn 0% te path kergin. (a p) oF 0. Hae, Com be chipined as the te fost £0 all pendant veatices. The pal dengin Of te binary Bee ri The above Ane (= 34+242+34+242 amd Bom I+ Wt HE rstS Awspechv . The crpottamce of the dep aba Lets rr te Fackhab As quankly to of Se a en alae ae te te ee Weighted Path. Length : Dn Aeme applicahens, every pendant ox verlin vi. of a binary Tose has avsocdaled cilK ta is ert neal one C2}, 2p, = =» Pry the problem a binasy Hee (eur minimizes = i. (cou mM prdan verhiees) tha a tne ly & let of pendant vain “y gil™ Jur ts Aokon over all pendant vertices wn tg T; hn lay ‘A. Ke X\, ra aa Ks f 7 ‘ S Tz W(t) = 8x 24Se2 + . Ca 46 wt) > BRE +SHELBRE ATI = 4s W CTs) =S% 2 + Sx BeNel= a Ex ® Conduct opal “bax “a. he soesyhls 1, 9, (2, % 10, “ce Find the coraght of 7s Sohn. anrge ts tr dacacasing Adee. , 10, WH td, ty, 16, 24 o WT) 2 9x5 +ORLHIRE +1223 IGS HORS + 2y XD KK OW e \ \ / a al ie. & = Uh | Ramk ood Nullity Gt & be graph ositk v1, the runmber of vertices ond €, the number of ed Ts oma Cornponents Gr haa. k=l, G & om . Bene. vey. Compene a te gree at Foe otteaxt one teas gn oil bee nig Ae abit Gomporant ‘lags the umber vei el ~ Crnprrant minus one . “WTesefhi2, e> 1-' pom corsteainlg n-k 0 ord e-n+k>0, Trace numba m,e,and K ase mmdependenl, and spumdamertal numbers in graphs Fawn atuse “hdee crusmnbess Fred os ok pd van id faa 9 th ‘ Romk A= M-K nul Mee Steben Oe paph is m=! nd Be rally, e—n+)- Sy umber beatrohas inn any Aporming = a Ut Bao ae = rummber of chads im Cr. | ly crumber. of edges in &.- pools age graph 1 also Aefessed 0 at Us — aie ue, GP fash baktt urnbes- Ke <>" Pemk of Go = runmber of a S| Jeong ha We pully Of = “maint Aomk+ rullity = = crumb. of edges = 14 -9¢. 2$ Cub- fet det G be a connected graph. A Act S of edges of G is said 40 Joe O discormechng edge set in Gy tb de kemoval of S from Gi descomnecls “G - A ALS of edges of G ts Sard to be a cut-seh ing ip the follosirg #00 conditions hold : OSba dizconmeching wet im G. @ No proper Auibsct of Dip k thames ‘alge nat Fo Nol: As rrentioned eaaliee, Ik Ahowld be Ynblid Aat coher? om edge is Aamaved (deliad) tom a >the end veah'eos of te edge Cobre to Remain } 4 Pr 2 f OR — HM, a0 excample , Corséder the *s is Ahoun im “fuguaa oo d the Act of edges s- {a,c} fF Sai the graph v, woe observe anak, Gyhe edges b WNS “Sey ae ein be “papine- ,! : bas ¥, x Ade Bince rernoval of any ‘fiom a tee baaks the Tite imp Awo pas, edge of a Bue c a Cut fet. Cut ret ane of great Cmpettamce tn Atudyying prsperhies £b- Some _?, ie Oo Cuter Consides a aApanming Aree Tina conneclad graph Gr amd am asbihary cub-set S in Gy. Te u porritle FAS mot sto have amy edge C11 common cst T ? The amswer is no. Oltexcstse, Aermeval of the cut-set S from Gr woould not disconnect Me Glaph. “Theutele Tiedem & cut-aet tra Commedltd graph Contain atleast one branch of every Apanning : Will the convirse also be Aue? In ahinoads, coill any eminimal Act edges, contatning at one baanith of e aig te bea oa ammmenr is Yes, wv lot & be a minima! Trediem: Exe Cneuit hes am even number of edged in Commo wilt ony cut~ Aer. Proof: Consider a cut-0b S in graph Gr. Let the Removal 23 - Famdamental Ctrcirt Cr be o& connected T Ee : fi stout seed i lee! ee & called a& Pom 4 a chéid bo pemnrnin’y Feat dal CiReduk ee Bx f 6/ ‘e fa oy a “\ %, os aK " 7 wo cvs {. Ss * 5% 1 ay. hoo T ax} ta nada fr he eo pan ce , Thon a ost esh edges. be pac hee a Te EN Ei enten, ony @ - n+l) chide 7 4 — 1+!) number of fordamental cisuile. ito Me veahe® of G tnto tose Crutually oO FL dixjoint) Aubsets vy, amd Vg. Cormedes a. cieuiut Lim Gr. Lf all Ae vesheen im F ane entiaaly cuithiy veslex At vy, (B Vz), the Tunmber of edges comme do S amd F ig teow, trot &, Ni (SaT)=0o, am even rumbey Zp, om the offer homd, acme vesias m my amd Aome tn ¥,, We Aaverre back amd betwen the sce Vj omd yas we Pravesse tie : : 9 Q Recoune of tte cloned. Golure of a circuit, The number, of edges coe tow eo V; amd Vo must de even. And ime very vin S& has one emd'm V; amd the offer in Vo» ™mo olter edge in Gy has this pRopeaty (oh Aepasah Y and Vz), He number of edger Common 8 and I ia even. mental Cut-Sete: Conmla a apanning bie Toh L Gi. Tako ony bramch b m T. 8mee io} & a cut-st in T, {6} pastitions all vesticor of T into two disgoimt Acts one ot each emd of b. Conudler the Lame Pastitter) of Yeatices 22 Gi, amo the cut &et S im G that CaAkeponds to this parhtion. cuts S will contain one baamch b of T, omd te Rest (amy) of the edges in S ane chide cil Acypect to T. Such a cut-et S Gntaint Cxactly one baamch of a Hive T is called a “fundamental Cut set cil Avpect 40 T. Sometimes a “fundamurtal Cut—zet 8 aleo cold oa baxte cut-Aet. ra7 the blew cu O Apaoning T (im heovy lines) amd all five <8 eran ch i T ase Aon (broken lines cabling D eabvnih Sit sy milk mn rep Dae aires unique funda: ro ed oper q thamch, of a. Bearing fave clobure® o uminue able also be Kept én mind ens Sendeckond cut-Aet (Like. the tovm omental cixcult) ha& traaning onl ea supe A ak aponming ize - “Tradem: ines given Spanning Gee T, ached c, “Prat leben mented cisuiuk I~ OCcuas 7 pray “fords cabo) anos «ike. far in ee eae of o Coneced geaeh Gr. Prot: wae & a Ch caheohe ts Pee fd cams seantiah ae teat U will ffm & fumdomrental cereuit Tye r= fer, b bs a ) 4 dt S, be the "pumdovmental out Bet dodBwnined by Me baamoh ©; = fh, cas Cp} —@? | Herz, ik ts chaos thot be ako b, eS, as betas, we Kmow that, [Re coeur and cutadl: wall Contain even 2. Cy must anutt be ona oF Cy, Cowra c, Eo Ce eS) 39 - fat Gy = fundamental out-sit dattarmined bg the | bramch by “Tm the SA ae Ce eSe lot 5 be a “purndarnerded culaet dag bye baomch Jon} ° FA at is dbase trot bxa + any! Ce Spa 1 O9€ ae fag. manne, we May Bh cS RONND Oo ‘tho fondomental cubact fees not talong to I. Wwe get tat Are Ci belong #0 every fundemer ololey hy by. «Bg « Hence tha prem: dt .& fi <= ic b, 4, bp} —@ Her, we Fee Ci © sot —O - > we Know cut ek amd coxa clk Contam even of ealges aldiiladl -2- | 2. by de one of bb, ...6 “.c,,b esa ~ , “@ ben ( temdamentel carat dbisimined loy c, chsd) dite Tp = omobe, sfurndonmental oBoust olbsranined ly, Srmilon 40 above, we way Bho tral be Th dot Cea, =a ‘Bum domental oot cura Ce -: chitd Cua, &S 3 wh be Trey jon Mare coil be no 10. in commm wim S Omd FeeH! S ob & ws ~ dixysint union of co mm the one ° ae a Ue < WS p«€ ts os hing toon op Be folrsing Bea rae weit np < [dere] anoles, cul-ath, @ieoue F}- fac, 2 #} omoler cut-ath, 44/09, Te ieutl =$4,e,¢h,k} a th a se int = union of cut —Aebe . we —22- Connectivity amd Acparability connechvity : Each cut-adt of a conrectid graph Gr ConsislS of a carter number of . The Tuunbee of im Ae Arnallest cut- at Cie, cut-seb cuith fewest wenboes, of edges) is debened a& the edge connechyity of &- Equivalently, the edge conmechvity of a Connected Qeaph marie me. eet RE cen Veale Cormedtivilys The. veshix comnedhivity G Atrnply Conmechvity ) mocked Qtaph Gr te depuined Os te minimum eh Of Veabicek cones Aermaved ‘ftom Gr heaves the erring graph olizconnected. Again, the vein Conn ech wo Bee & ore. a Sepoalle Gaaph: & connecied ts add to be Sprinkle ib iB vertex ceomedivity is one." All ofher Cormeclad Graphs one called nonsepasable . Ina Aepasable raph a verlix cohese removal oliscrmeds the Yaph is called a cub vealex, a. eut-niode Han asdiculalion pont -sr- aiden v im a conneckd G Ba eutoyaee a Up these enue deste mad a eveuy path behwewn % omd y passes drough v. SY Ny 4 0 hove n=, e = los Fa the “ust gpayth hae veslix Conneckvi em necivi ~ Rat the Ae hes eS medivity 6 four. Theda: The edge comnechivity a & camnot exceed the lance of Hee verter ootlh clageee vr Gr Proof: Let verlin vi; be se coith te Fomnallent Olegeee in Gy. bt lCv,) be oh wy . Veen vy; cam be Beposaled from sy gemoving the dens.) edges wnedont on veelin VW the Theoden Me se. commechivity of any graph G com never czeeed OF edge comechvity of Gr- Prod : uo ete He edge connachvity of & com Texophe, Thece MG a cubset S in & wih of edges. let S postition the veshins of Gr into Aubsets vy amd Vp: Ry farnovirg vertices from V; (eVe.) ™ cohih ho edges in & ase vneide, wal 0 S (dogether ewith all offen we com effect the Rern edges umeiolemt 07) Arose ves’) fiom G. Heme the Thedom,

You might also like