Connacttvity » A path Ina mullfgraph G Coutts o an alternative goguance of Vortec and Edger Ty he for Bh mM W514 He eee! A cyte Is a Simple CTraut wlth ne otbay vepoated veritas excapt Ts and veriteer Connected graph t The graph Gets Sald fo be tonnacted , 1} there exB4satlaact one path betwean avery paty a verttees Tn Gr, vthewree® ‘gf ts Afeconnactod.” . Btmple path: Example vy A simple path fs a path In which al) the varices ane dfbitnck « ae > emactad graph Taal: A. poth tn whieh all adgos are dBitnce ts callad Tra) - Nowe DIt V,=V, » ten P ts callad a Closed path.| 2098 V,F%, than P Is called Om Cpa Path % % Mie \ Ns =) pieconnoctod qaph . ee ie Craeatt : SOR path of larigth 2] wlth ne Aspacied edges and whora ang verter are Sama fe calle a Chvtutt© p 2 a graph’ fs © oer each there This A vautor from [EBEI® Derarmine wheather ane gtvon gtaph fe 4 path ta athe folewtay guuphy 2 Witch pais axe | Comactod Stmple which ose Chrautt that ace the ») longins % those that a2 paths 9 ° . @® %e,b,c,b Oesd,a,d,b,e le t © 42,0, 4,b,60 © bd,ayeye a) yas. »NO ° : dfecennectad graph » Comite of ir e — two tor) move Connected Raph each o% een . thoce Connected Sulgraph f% callad a © Yoho’ : Component (ox) block : Wh patk af length 4 (pynet a Crank get siople Thaom 25 ® eberdybee ry not astep 18 & 18 aph wtih “s) varies and (D net a path rh not a that (Ih nok astm | oe nk comactad $o a Vester W, then © ae,adybeva there exists a stmpla Path fiom ¥ tow WAR A 7 * move = tha oi). (1) Nee e peak Cf) not a chautt (IH}) ret a " eos) Oc, b,d,a,ec Let Gr bea graph wlth “n’ Verticor Doha o% length © and a Vortex ‘y' ts Connected bo a Vertor unTo prove: To, pveve There & Simple path from Vito wo length nok more than (n-1) etal Buppose not , sthave extsis “a Simple Path {rom '¥' tow! Cy aye % longth move than dob OV =, Say the Lengths Ts “8 ios no verticer @Bince “or ts stmple ee edges axe repoatad ince “Gr has yerttces which Teplies that The tea Ganhadfetfon bo path has Jangth ‘nm " hare exkis a simple path from Vv bo tangth nob more Han (0°? owe proved and at wo “theavern 14 Aeneas A Gimple graph with ‘s' verttees must ba tonnected. If TE hag more thaws (D9). cages 2 & Pawoh: oe or bea Stmple graph wlth ‘n” Vertes and has mote than (n-1(n-3) ut aoe To pere ‘Gl Is connected ehuppoce not, 61, ¢ ae nob tennected . Let he Components of Gr be Gy ond Sy let V, and Vz be dka Vertex Sok % Gr and Gi | Ive mg Wylenem 3 lemen-) Jecool =e (6, v6, 9| Now, | = Le Cen) | YE C9] 4 mem) (nom) (meme) (ty 2 a x yw nt amare em yh eptiioe aonb)... [nn -pam mare whe ) - ato) 2 = fren) -a(0-0 ta man sana eb fo m-a) £4r(m-1-+8(m?— 1}=L Jor 0n-a9 —an md telnet 2 = x(n) =a( m1) [n= (m4) eb [(n9 fn-a) = atm (ome) £5 [wy rad] Veto} 4 A (e904), sis te a —=>€=_ to Gr has moe than wn) (n=) (nei Edges a + pur ascumpiton ts wrong pence: or {S Conn acto once te Prof | aa A ctmpla. graph Gr wht 'n) verter and ‘k’ Lompenent® Can have atmos [Theoxem (nok) (nok) pages @ Fase tl Jet “ql be a Simple: graph hte Sp’ Vertes “crn "1k Components Say, Gy 565 y ~~ big 5 Jab Nj ay; ——-ny be the no. of Vertler In each & 'k" componente My Now, Jeten} = | ECG,vG,0 ---UeJ1 = | ECon ate Ce, )[+ —- +fe Cone 2 nym) aD, 4g ny l-D = B nglny- rr Veto) = K Now, _ BOM tasty pH = (nant-— tM) = (EA am |E =) 2 (n-1) =n-k i lied Ue x a 7 SZ (np-1)) = (nk (nae tnep't - =e £ (nek eer: > infamy b--4n,2)—aleand —4a)+ Koy Gane =. gc antee (n-w)? (by 0) k QP ielw) = > ( = Eft" a0 -] ot [ots 6) = + [hm [ined] = (1) (ree fc) Pd So The no. Edges Tn Gr fs atmase CSIC eta ‘| Theorem : 8 nial - ‘ 2 2 f AMD Haat Nor l-an, £ (n-k) 1) E00) pee | Tet Gi bea striple graph wlth 'n! veritcer jena I Slop 2 [PL], then Gi! Is Connected where $(Gi) ts the mintmum degree ef Gi" lek Tet Wi’ be a temple graph wlth in’ vertices lana 14H $9 = [MJ {qe prove + Gi bs yet Wand 'V [a4 te onough te prove, iG Connectad . "be any two verttcas th Gr wand ¥ ote Connacted T.P Thave extst: @ path fiom Witey | J Th uv Te an edge, there fe noting te prove , obvfously “ui andy’ | ut 2 4 uv fe nokan og: ane Connected | | let % be the Set% Varlteor adjacent boul ken y ¢x "4 Jet y be the Soko Verttcos adjacent te ¥, [than “suv fs not an adge tiand Vane) uf fe dies) Nous RS 2: tol 2a (OF ae gpwy) Ix) = dag ta) = S(4) > [5 TyV = 4aqtv) = 5(G) > [ve]KKT \euy) = px) ely) —pxny) n-2 > dxpy) < bel tlyl—)ynyt A-g > Ieltlyl ~1xny] n-az [Je[%.]- bev) Pa Z Ae Jxnyl n-a-nz —Ixny) 3 = -Ixny) & =) xayl \dyeny] ee wf odjacant fo both U'and Vv" tonnactad . Hence Gr ts’ Connectad . Corplemantary Graph. (Gy! (ox9.G) Let G(v,e) be a graph, the Complem Of bf dagtned to be the graph G whieh has Vas fi Set Of. Vexttces ‘and Two Vertees ane adjacent In G& $1 they ace nok adfacent fn Gr. + There Gktsls a Vertex wlth Hay Such thot |e edger . Thon how many edger doos G Ue) Uwe Ts a path and hance wand ¥ ore stb. copananien, Geeeh = Ce) ts sald bb ba Seth A Graph P Ts Esormor phrc to Gt Complementary graph Mh Gr Note : [Pom :! 14 a graph G hat our vertices ang have? \ Gene eh hea graph wPth 4 vertttes and 5 edger, MKT, TE (two) = VeCowe!) | = leon) Ete o1 = => F +le Cod) => 16t)] Veto |=\. Ge has 4 edge .| Pome -a iia + Then how many edges doos chon ce tare bet be a graph with "V! verteer and dodger Mat Ve (Guo!) ” e+ leo} =v = jetwl a y? => leCwl se yr no. 0 Vortteos In sn Gitvan cthts tmpltas “tha F => Lete| = le Ca!) Te (ua = nine) E > fs 4m (ory dytn-1) ‘gl te a Sag Complemantary raph Gr te Ksomorphte fOr Wek, Je(oo) F1EG@O |= 2 LE Co)) +1 ECO! TECH] = nin q > . Jee) = nia) oh aya a Poph Gr has V’ verttes and TeNo-a fs 4m (or) din-t fra graph Gr Gi! shave? (stnea A should Alvtded 9 (ova Veep ate Coes) = Ren 2 [exanele ep as Pbm:3 py a Seth Complamentary graph Gy. “then >| Fuler and Hamtltontan graph Fuley path + A path fs sald to be Soler pots Vb J foniotes ay the odges the graph oractly OVC + Euler path 1) B—A—C—B=D-e oS pe A Chutt te safd to be Euler oChure 14 Te Contatrr -all tha edges % the graph [exactly once b Example ¢ Eules chal = Dboac—d e-CF : yi antec bae 3) da e-b-a-c-e-d Eules graph ¢ A’ graph {5 safd to be Euler groph ry Te tontarne Eulex Crrauttes pai? Reelin hee? TREmLT Gane an example gov.a graph whtch 12 (1) both culey and Hamtitonfan UD Niethey Euler nov Hamflton (M7) Euler but not Hamfiten (tv) Hamfhten but not Euler soln WD Both Euler and HamtHon + A Poth fe Satd Ho be Hamflton Path ft Te ntarne al she veritcer 9 the graph Ex . Example sw, Ys amfiton path Dy y ny %S yy « 8 Vogtle Greate I enter gyate tL, A Cheutt I Safa to be Hamilton Crreutt Th 14 Contatng all He vartfeos 9 the graph , exactly once» oa (WD Nether Euler nov Hamtlton : » 1 Se y» ¢—d—b-a-¢ * () Eules bu: + Sten: CX @) d-c —a—b-4 Elen bat ext Rawls ¢ 4 a B geese He ; € A graph Gr te Setd yo be Hamer graph a a é 74 Te wntatn eee Oe een (WW) lamtiton but not Euler > Ey Hamf lion wen 4@ “Ech - d=c~a efsa qpaph + A WT geph Gi & sata b be planar si fe cas A ae dawn on the plane without Indersecting b #52) SJ € Ky, # a planar graph Note: an tomplete graph X, % not a Planay Cut Vertex t CRSA Ty vorten: a a tamnected $4 G & a Vetax whose removal Incracce ha number of Components, Clearly , 7 9 Lh a tub verter % 9 tonnactod graph Gi’. Gr-¥ FE dfsconnactad | Bafdge (ov) Gat By a gap an eo. Such than @/ ts said te tat odger. es a Sees we ain as “(iy ak Vertex Hp cut adges Mak’ og os 9 each Vertfcor @ find sha cut Vorttees and cut edges trom the, rT qer> foe (i) cat Verton = PW, M4, Ned fn Connectad Raph fe Euler raph ‘8% Bae tent ty” Te Connected and @! 5 ‘that Gre Ts alecomedtad . bo a bridge (or) ay es & Ny y 4 le y, . 57 fey -4 £215 2%, G87 ts a) even dare -| : | feos: Jet br be a connected aph. | Lees ‘ef suppose Gr Ts an Euler graph ‘le Prove ? AN the Verttcer have even dames vy Since “Gl Is Euler, G has cular Chauft with nfltal and end vertex 4, Fox os vartex Uy d(uy=evgn For any Vevtox tn G 2 AOD = Ox No. % ttmes Tk, oceure 264 | 7 intornal” voview tre Led le) = even ance all the varttcer have an, evan dagree lar past * ‘To prove 2 Gy’ fe an Fuler geoph @inco "or! ts Connected and all the vertfeas have avon degree . plo can Combuct a Ciraté Ve! fn Gre , casei) ae er 34 ‘C’ wvers all the edger In Ge, thew ‘o! pecomes ao Fuley Chtult AA casectt) * . Ee ty 16 does not ever all the adges ta Guppore each ef varitces tr Gr Te oven depot nce every vortex In G have even degree every verter tn'Gi! also have oven degree - Gince “Gr fs tonnectad : tel te saWe can Contract a chrente“e! 2 tn Ge! ince G te connected , the Chreuft ¢ and d| also Connected, have the Common vartox V. Then ¢ and ¢! Combined wrth each othey form a Chvcutt - “thts process [6 epaated unit! we obtarn a cireatd that, covers all tha edges Of Gr. ‘G! ts an Euler Raph These 110 94 a raph G has not mare than g verttce % odd degree , thon there Can bo an Fuley path tn Gi- Prooht a, mm" Let “Gy be an graph wlth not move than | 4 vertttes % odd agree 5 Say U,¥ Let Ga Grput (ndd an edge uv tn&) pil the vertfcar th Gi! have even degree has euler Ctreth € Then e C-us tan auler path In Ge.@ here NM ( ptyac!s theovam) It ‘a! ba simple soph wlth Verthces, N22 Guth that ,the dogee % | verter In ey 6 atleact nj, thon | *7nGa, ail he verter % een dope. Hone there exits an Euler Chath In Gy |The Euler chats Te Pb.) tnd Whe Fuler pate Co) Ful Chari | A-B—¢—D-E-A-~C-E-B_p- sy fy extcis Tn oath of tke -tuoo goals bole. TM Fuler (treult hae sosdilger axactly once it Tote doos not 4S, Oyplaty chy > I bt ic a2 ePlato why? g @ grow that a Gmplete raph Hy wlth n>s has . aoe c [Hantltshtan cyte -abtate all the edge Atgfotmed —HamtHoatan eycle tn ky > 5 joln > u! E PN [Milt net ul be any verter tm Kk, | ING, there axe. G Venter oh odd dopreg yance Gi, Jb nether Foley Poth mov euler Cbauty ani “Gh hat a Hamflkonfan Cheuld » & G, | Whtnce Ky fe Complete 94aph, any two verter jaa adfatents Therefore we can Combuel a A Tn Gry there are only two Verttcor namely, Cveutt whith covers all he veritos.. Aand # G depoe 9 and other Veritces are”), Traber’, there fe a Hamfilontan ele o% even degree. Hance there extis a fuler | “*~ ances: tami riintan Path The posstole alge —dtefornd “The Fules paih fs A-B-E~D-C—A-Dog Hamfilontan Cycles ave, The Te an Fulerfan path ,as Te freludes cach % | $98 -yo5 6-4-1 she 4 edger exactly once. 6-3-5 yea yk l= 1-3-6 -2-5-)