Unit -3 Vee GRAPHS The graph 4e collctton es Get of ast nee and edges - Vista > the Ginaph Cv,£) has a set SV! called “Vertes” Dedges . tre tonheets &’ tla " ied tue vertfeas Constettng % too elements Subset my V Batu Mey ae . cb m7 : few Vi /¥erV9 , Vo oie ween e “G \) 1, &, --- 2 ig 4 trusts te on edge From vi ter Heopt> T than snar edge 18 calle oly ler wer Ane spar? rogas ( ent per es a gor 2 teas cages eae (the graph hoe fanatlit "¢ ae *o ‘ é 4 Adloane } ages a Ware ae asunt 4 axe Two adgas ame datd) aouaed Qu tnetdint on a Common Venter SH tee vertaus V/V adjasans 4 beg Vi. Vi eo baits Pere fq: @5> V4 Vs © tsclatkd Verh! SAS eee Vertex having no edges sandclint on t& te called on 180latd verhr Yo ee 5 on a: eo Dineeted Graph ep pt tee agYs NuwLigraph (apr terndnotogy + Degree: Dagree | tee Deqrec % vente teThe Wandahantn¢ “Neoven f MM an undtneted qrarh w wee dug cud new 7 Ny “ oe ' Ce \y on Vo dag M22 dug tw? 3 deg vad = 2 deg (v4)? 8 ire 4 uy > atS 4343 néev ae a a S109 0.1o Yerttees @ath of due § n> Sum 0 to VentteesBs odd V' Buch that degea) = 3 degew= & and DE Ue aajasSine each ViPa > Ad AY a >aq ww) Tndeqres — > deg Ww ottt degree > loop > has both Incdeqree ay 0 Special +ype op graph Requianr bviaph: degnte 82 Compete Graph: (Kn) n> Vora it mast Eath -Vverteae te dhs"bis at eg! Draw 2 regular graph Vert ow a Competi Graph: (Kn> “Tra Qyaph adjaccent then such a grCLP Qraph- J Every Compl bnaph Every lemplii onea v " regulary graphcomplet Bima graphs bipartion with Via V2 18 Veuer Vi is adfasant +6 dunota by Km n kia Seame V7 BAPY Yo 2 FBC DEF Rew Be fs edge —Subgiaght The graph b> (WE f : ak Teh 1 owe) 1) Wayne Fg: Y ontatned inf \ «) oe rs Z e y an Buabguafe tt Va: a Subgraph Matun Representation : Adpeenues matrin : — det bev, EB) > mn Vent A> [as] i. y o oOTnident Nasri" nxm 1a Be Pate makin!Connectitty wa * 7a+n tually) > Fath tn the | quiaph able Ma, - - Vn 1 Ventas cath acy) ¥ Strnete perth : Msc calld a6 4rafl. Hone spcabd cage Clea os etme pe Pat: ALangih 4 PO cages a, V the path ie elfid Length of “Alte: The path ws gee 4 2 Ou fame S a Reathable: Te vente. te L Year cadets Path trom A Connecrad: The graph ta f Verttus ane(B) crear ts0moRpHEEM | Cw0AAlacency matete of a aobe asd gin Ans ao o> oer b [te Mp 5) ORD clo \ ‘so q0Omeg a po to eee Cy) o 0 oem flo 0 wo tam be, 3 oO” b Sc da loa * o ! (9 ofmame 1 Win ony oo . \ > # ia 4! 0 oO uieeD ° *{| 0 o | Sogou f o 0 0 SORE Stn we cart mate At by) tntewhanging -Degree sequence 4&1 213-274,) | Degree sequence og Hi A, 2, % 270oh 5 Determine tre following Heo ane the Fotersing matrie or {somorphtt Swaph by Shucure. Verto dierae dere adtyacencey wy 33 \ 2 = az. ow Us > eee Ne a ve eee Na 4 tO Mthe 2c ee 2 Us 2 ae wat | be 2a 32° Nbeaseingy } '-t Gorrespondane + a Na Urs Va y } tas Ve ’ , wo Vs , - uss MW wo vepula drutt? nds + Staneing «4 ending famdtiton Path : tle mupeatid Handlten Grusie t 1 Btantt coy sind ae| PT Hamitton =| b Path aie wee i Non ' A qran tea eutentan | ane even degree Proot nn 1: 3 Pant —p Assume | Gr ‘ Sine is eulerfan , afin © Sorts and ands ae dew: 242% Tae nue octuns tnstde SEvery Verb of Oe ts een fant ae andl Assume : Every vette of & te TO prove: Gt te Eulent By contnadicHon : kt & te not Euletan Strnee every veto 1 as two) has Uosed cycle , bc be a Uosed eyete of tt &@ ce Euler but by % Bl6y - Eee) onR23 has hamilton Cytle Aigjotnt — hansftton cycle in Ky Sain iedore THEOREM | Csutetend lat 6 be the graph dag u+diq ven for each vertices Of Oy then bu te Proo, ! Assume + & TS not Namftiontan Cie)’ Gt has no h we add some edges to Subgraph H 4 kn, wl H+e have a hanittentan ayeHenee tor each verti 19 adjasent tm » but not * However trie means that deg Cad tn) - deg Mn : Sag Ot dag tn ent” Sis hamittenfan Texte DRac THEOREM 4 & wa N23 Such that bec ce aul Ctuast nye than & ts nara wie Pret © ~o a4 Case om te * aa