7 Graph: Collection ot verktced | 5. GRAPH THEORY ond edges. Nestices ave. vepyes- “ened Lith * V “ond edges with ve. Divecked Gvoph: oa Ree ou cages Ove | salchi pai fev example, cS oO &b , ; . We Larbigdy- Gartic 10 E=-{ Gad, Co: oO, acer (4) ayy 4 Non divected Gvoph: fh qvaph ain Ohh edges ave unordered Coe V5 fac tb, ay a E =k Lapp bch tod yy caekhay Here the eolget Car) nn (b,0). cla en | Loop oki ; A Vevter comneck ed to tise lf 2% called loop - Sterple Guoph' wtqaore bo tosrtd f\ gxoph -uith no loops 24 cabled. oO simple graph . \ ‘CI Pp Non Simgle Graph ft qragh which hav € sel | cobhed Tan simple qvaph. ( zi | of: vk De o : yi , f a} Wv\ = n0- of vertfees >| EI = no: of, edges. Deqvee ol a Vertex for divecked qraphs, there are to? eq ves, oops 4s@ Indeqree ® Out —degvee: _p|How mamy other vertices cure Conne -cked to a vespecttve. verter 7S M- degree. a7 Prom he, ¥eapective, vertex connected -co all othey vewticed Pg outgoing Jor out— deg vee: 7 > 7 / [a won __t TS notkacceisc e , . . Pnadeq Co) 0 . BndegCb),< 0 orddeg (He. 9 | Ovtdeg (b)s2 . Trdeg (c)=id Tode (= ° outdeg (d= 2 Outd eg (A) =2 | Tndeg Cedis 3. Oud Ass (e)= 0 Degree. of Vorten’ pnd nov divecked “Giegh The no. off veabtces. Connected to 4 boxstyeular Veaten S$ oe of Vevlen “bf nom divecked groups mo ye v fo vedetracs he 2 degide> 6 ope Aegtey = 2, - j awa c oun Aheg (a) =a dag (b) = = 2 7 "bs deg C= & dug (3) > 2», Neighbouring” or ov adjacent acent Vertes Hy there °s om ‘edge, bh one § vertices, then those Wo verttces a, netghbousing by odacent Verkice Summation Degvee's Theorem Let Ve 2M, Va,---- Unt PS AVertites of nen Atvected qroph G j then When at the degrees off the vali ove added, each edge Contributes A edunt: obj Ml tothe heaves, .of eoth of the L verticed a ahith re edge. 44 Wm c&d end : Covollayy: = an ony er) ‘Anvecked giro 61, theve 8S On even number of verter of “nese odd degreeDp , | for erommple, 691913) %) \wie 4 Summadttor Aeavee Sheovreny, yi {vor ZABrStBS RAVE) el = lb os allow teled. 4 7 a Lb Ps theve & graph Lory Ve degree gequence” (1131213, 916/ 9 here IVl= ‘ so Vie alel ee each 7 lel=i39-3 % Not a gv4ph evkiteh with odd Also, the no. of vi 2 e mot even: So deavee ove 5 ae not graphic CU, 313,3, 4, 6, 4), Ee yn IMl= 8 1 = Feg Cui) =Ajel le) e levee sages apee ea a2 1E] = ly> Poth + Tra nen Aevected den Gy, & a beng ~ence P of zero ev move. edges °f he’ form, : fq gu, v2 4, ae ive rwMpy he es called a pat Prom = Vy Vi ts “called *Arkial vertex amd Va 3S called sterminal Vevtex- Both ly, omd Va, ore cabled End Vevbced > dh Vie = Vp. thé He pa te called ‘|cloged - poth else Wt Pe cobled open path . Lemgte of The Pat Path Whe no: of edges in ) Phe pot ‘4 cabled tength of Hae path: Sferple Peth + A path ‘Pp’ iS Simple dp oll edgesLama... VANCES . OM Tne Roath Ove | dgsttnck except, and, potn ema vent ees. . Civceutt , Lemgib ot Whe path 21 wth a vepeeted edges ond uslhose end fo- Ants ave equal Cvertces May ov may not yepeat) , Aer Cycle" A cycle by a cevcutt with no vt ted vVertPces except end Pofnt. 1S eth, Biple’ [closed [open encalqe e Path. |Polh fur de xu] i spdawofios [Ux x x |~|4% <4 Ss x srile w = x we |Pes x x s De *DB Os Wlytte a Stmple possible Cxamp|, of, nen Null non dévected O having No Vewlices of odd dear, b> S ATT & + S = a sow G Haut Le : en3d e hay ng no ve ces of ev 9 Segre 3 2 3 = 3 3 a{\ ) |Suppose thet G % a non dovected| qvopb with 1a ealg es. Suppose thot, 6 Vewktcea of degvee 32 amd vest ot the vertices have deg vee lers Yom 3. Determine the mingmum Dumber of vertices oF! Cam have |] WKT, z deg (V;) = ale] i = AK19 = Qy deg (V1) tdeg(Vy) t---- = 25 B+Bt Bt 343434 KH = 24" a meons eel) Verlices de gum ts 6+ Venktce’ aveadle a 3 veyt?ces have degree a 2 a” Verte es have ade yee | Or & Verlicos hove deg a ov 4 Vertiles have deg. os Q- . | 0 |Aveady 6 vertices have d Cgrvee 3 amd £, te 3 Vertes have d o oO n & &g I, oe 643 Pa minimum. too mony verttcer Lo? Hy “fll a qvoph howe th they contaen “ele and ce Verk?ces of Aegvee J >| WkT, = deg (vi). =a . v= | y = L416 =32 , | DaAtatatr--- +N = 32 an =32 . mele ! ay,cdge aed all vor eed, PY) PO 290s fou, AgarP & ty a |Seme degree: J x dex, 5. {ei| @ | 9 deg =} 42 Vevtices d 93 ay Verhteys fee — 16 -4y — 12 deg= 5x deg = 6 — 8 Aeg = 7 — *X deg-s —> & al eg = =o —> X 9 PGF! DX sn og ei Oe ue eg: eS cer | deg: nyh tm 3 deqit 0 Hence ,mulkples of 4g wort! be He hot deg have vertices. Prove Wok for amy strnple | nen devected graph noof edges of a ?s less Hom ov equal: po LmMn-) where 0 AS no: “of Verkiced Gra Shmple nen divected graph,PS haur na Ne eS yl ae Max (mun Se Mast ley degree By usin pe man degree of 0 Verices leg (n-")4 (n-V)4--°: nvevtHYyCes = & le} 1 (N=) = Qx le) | t€\= Len x) i ( 9 Summation degre e Theavery Let G be a graph Such the Pt Phicae Di Mert ces -onol/ 7 eda ex, wre degree (of. the vertees fs K ey lay. Prove thot fh. 6 bas Ny Vertices rh degree Wand Nuss vertteet of degree Kay them Ny =(K+Dn- am Geven 1 Vertteer amd m edges, degree PSK BY Ke) oF degree (vi) =Q Je] q arp is : oh = &m Given, on verted of deqvee k Nga Vertices of degvee Kt! (Ms deg (v;) = dje)WN a OREM © Ox KN KN) Nica = dm K(N, 4 Neat) - Nea? drs "| Ny ' Naa =” Nia cs n-Ny Kn + V-Ng > ar Cae tt Qin = Ned 1 $5 g What eo "Wren longest pos st ble. nee verdes ee oO graph’ worth 3.8). “ledges | oma pu ee vat Aeat B oMeatl 3, ia an ( { Given lee 3507" wal og ms s deq(y) =Ale) =) ‘ = Ab35=% Evemy Ven ten men degree 46 3 BA BAB tee | Ven (es = Av San = Fo ty = 1), 293 Eran Oe| Constder he Aeg vee Sequence of ipa, Byler te 7 itheck whether degree Seqpencé possible ie moke a simple qvaph ey not: Gaver \vle= 5 =n0.0f vertices S deg (vi) ~ AE i=) > ar3aeyrters =AlEl >\S-alel’. lel=9 uemle, the degree Sum.ts not graphic, becauge Maxtmum deg yee of tn-1) wheve PS No-of vertices fre & but in Aegyee of Sequence deg having 5,$0 % ?S a Contradiction 3.3.4, & 6,6) Ps Degree Seqpen le Ce ae i possible to make Simple graph: y be Geven l=, 5 deg(vi)= 2lel real PIFBt BH yer seb +6 = @xlé) lel=l4 Hence the degqyvee Sequence PS nok gqvophic . Because, man deg h(n) oho nN Ps noe} Vent er » t-ec 6 but mare DBVertCes de vee «4 6 ‘eid mas, ' eave’ as l, “mot possible fey Avau \ edge Tsomoyphesm Let G amd. Gi are 3 graphs: of GQ and &' owe Fsomoyphie, to each other ,%+ Sekt ees MWe -folt ousting Both graphs ionne Some no: 0 of |Nertices. = Both graphs Hae Some no- of edges Both graphs hae Somer, “ase Seypemce ‘bs. ie 2S da t ap) + Ly23i359 IvJ= vibe + ene a (e-=4 <- DSomndvphfe.Subqyapn’ a @ and MH ond o qr hs "h " © subgraph of q ia oy tf YO eG Vi) and FOO 4 Fe), Via) = faib,0,dF Ela) = PLeby, 3 bch fed, £40. fe,04) b ENE Tab kbichot cl} a ge pein! | VCH) = Laibieady — ECr) te {tah Lb.c, a H\ orp et ee ea parm ming Sub groph) Constdey “Hee Grdeplvs | ons tn ine . 1b) CZ tvl=8 lejew ; A\vicg 1éleil $ yoy 253,380 BY So RDB 3/4131 3 PFBoth gvaphs have & vertices ond 1\ odyes amd Same degree Sequn,, te 3 vertices howe degree a, ly vevirtces howe degvec 3, 1 Verba, has degree y fe, $M A188 B49 5 | On the Ash qroph NO pet y ot. Vevl’ ces deqree d ave adyatent Vee bifih - But @n the and groph, Wh amd 9 are adjacent to ead other amd THe deqvees ove 2. - —slCongeder the Subgraph rn an raph oO bi@'e\al. a6 length 98 4 So Such type of Subgvaph cloesnol exest In Ye JS qyvogh. >| Consider a verter degree & lm both the graphs: tn the first Graph Me vevten fs A. The adjacency ob A ?s aande: IK degvees ave 3.oamnd 8 - Strilanly cons?dev the vertex degree a 45 dal ?n and gvoph and adjacency of ad ore al amo oc. Ibs degreera ave 3 and & Yeap + WwBecause ot oll Hhege conde as by ia 3 c3 4 wl=6 Iel=4 ie $212,337 4,64 adjacent but not al ed He & Graphs ave not Pome! one) y phic <4 (ele? $252,3,3/ 4) 4F JDNot PRomorphic because a WOO