Giraph. theory Prvalll edges (oO mullide edges Guaphe A 61OPh ‘Gi? has pater (v,E) wahore vis onen- An a graphs there HP 0 pain oP vertices 18 connected erp ei ctl tas Ven sVsnefomnton [ena | ent oe (ee aha age oe (redes or pekwd.E 1S another got hase clermencs —lled_prvalle! edges a rrubiple edges cee called edges lines). AN The graph G ith vertices v ard edges & is wa HEE Wand ve axe un vetkcey which axe connected bef lwsftten ag Ge (ye) ‘ 420 elges ced op betocer Bem 50 Cale oy Eat Gs a sea © Postale! edges Here v2 §yjvad 6 26 Adjacents ih a gaph , ti vertices ax goid to be ata ‘an le eck fe asgoctatid ith an ocered |, djacent iP thee 1S an cdge betwceen the 4zo verti in (Uv) tohere (uV)EE Here the adjacency op vettices % maintalred by Redge Is comected to U and V axe called end tg ir i au a2 aalled end edge that 1 Connecting those t20 verticg ig he ) the oe ae % ‘3 3 Any uso vertices connected by an edge fr a a § Called adjacent vorkices a and & one adjacent vertices a8 thew 1S a » Hej lun alges csard ¢e ane eftent Sth aC™ corre age tad bho them ee vetex then they axe aalled adjacent @ and d axe adjacent vertkes, aS thare is a ae csrarion edge ‘ad? bl them. » RS ey sel? loop @t) loop fn a graph, Wf on edge %e dawn SE Tu foo \erten to fgele, % 16 called a-gelP-loop Here @ hog uso adjacent vertices u and v } ® boop. cn the akeve graph vy hag +o adjacent edges Gand er and vy denoted as facdlent venice P oe—?thich are formed at vetle, a, ond veh e b Soiriing tard 2, @ Joining | and3 3 doin (and 4, ey Joining 2 ies A el? leep oF loop ie on edge bh avestcn aa ‘by ey Solttng Here, v8 0 vewles fal hich it haS ort edge (vi) a there axe totaldy vertices. The Paiving aloop and WH’, there oe 4100 loops @ o St alges ia the graph ox 6, n en © ey g nd 3, @5 Jofning 9 ond &, ee cand itgelP Soirfing 2 and 4. The incidence matita i SFr aige db a graph thich slots ont onele ot ao ‘8. ooo the Sore vertex az [tl To 0 oT Sigrtifloance OF Gioph theory fa Ampnter Science aa The maior tole of Graph theory in Compuken oppleations og fags the. 4o the “deveepment eP" Graph lpia wuous. lit & en 5d gent a Problems that axe modell 7 tho |Qeeyee (oi) valency the rp. oP alges ‘cer on ovat > shatest algstthm tn oneluork win agrorh igtth ga? boop ccuntid Lute ¥¢ called Srey cater the dayee 6 valercy da verbs ord: ie dendid > Findking graph planarity . wy 81 dagha) > Algsithers to find adjacency reabricey ) b — plgsittns 40 nd the Comecledness Fy Algatthms to find the cyples in a graph ) ¢ a ar Agalithms ft Seoxcking an clement In adala Stuck Here there axe Lobal dr 5 vexticep The degree of Tneldence arc degree “of a graph Yeti a te 2 the degree of Vera b15 2,the dagred Tnddence vabiix s Let Gz(ye) be agraph such tha oP vere cig 9, the dagree oP vere die 2, Ve finns. Vad and = fen@€3.---Cm 9. then Tneblene the dagree dy verkwx ‘eis ero Mabbi2 A= yyeq OF thE gaph G is chginad oh Find the ‘nctdence amibix Ax the following Qij-1 WH the vere vy is incfolent 40 the edge — Graph ej and ai <0, ok >| fl: dn the above “graph, there ave a.tokal ide 5 vextine | and 6 edgep. the gi edgeg fn the graph are @, | nlg yond vy, & Joining yond vg, e5 adiing vy andy Sv Seinng and vy 0, Sotring vy ond Vs, & ening Va ard V+ the incidence Tabi of the graph 1s oo ht Ne 0 OT Oo 1 10 1 Sy 00° OL tly Lot @ © ‘oly Ot 0 1 4 oly | Ger €y O65 cy Find the 4% indie 2 Fell mee abot 1 the ng graph vo w ee hed Ys Solt ‘hn the above aga there ave atolal of 5 vertices ond 8 edges. the dight edges én the graph ome & SelP Sra vi sen ining vj and: vee, jlning wand Ys % Soining vet vs, 5 Yang WOVs, & dsining BL Ye > © Soining votive» &— Sel? dcining ve-,the ‘nelderce malice dy this graph ig [tr coe olrio Ayo 001 1 ©0000 o aco! Cr es es ee Oy verbioss Find the degree of Sn the & ~ A the abe Rgure th guphthae axe total of 7 vewices . the dagrae of verti at &, the d OF Vere bis &. the dagwe d& cig 4, the vee d tg Inthe digee dr e's 3, dagee oP verse g fis ¥and the dagroe ob vere gig zero hes dagia’). 9 dag ib) = .,tleg(a)- We, deg la) 1 degle)=3 degig)= , dela) = 0 Find the degrees dr vertices in the -allorsing Sraphth the abe grorh there acto a total oP 5 vests The dag de verlew a is 4,the e root ofy db vertex bis Ms ef s orterfy The dig & vedes CR I, the dag dy votes dts 5, 7 treo (hy the dag dé vex cis 6 i fos oott ily ghee dagiad> te» deglb) 6% cleg(e)» t, degld )= 5rdeglede we a ee oF Fel the “degrees dy vertices in the llevirg graphy Reletfon betiscen Degree and edges of 2 graph th ap ob ‘oye the sum of the degrees oP the. vertices % tusce aren the rod, edges 2 dag(c) =2, degla)= 2 es 90 Fagin) “TH dened -3, gl) 5 rea pe Sie, ieee) Rework aaa (e) 2) dagld) = a dogee 62 ¢ yy BED Bz Sea$ Give 0 Graph “hag wets ord Goch hong dae ling degla) - 65, cag(B) 214, dagle) -3 Le, 2e-£ deg) dagld) =6 Becauge the gun of the degrees of the vertices a s 1s 26 + 0x6 +60, tk Hows that C30 Find the Gneldlence matic fst the falloiorg Wow "rary edges ore theo Fa graph wlth, 5 Sraphs eae, verkices, our of which @ yertices have clegree & na CO [M2 end 2 venttoas have degree? Ot 168 2 Je given a graph hag 5 vertices souk de which, 4 es ° k " : ‘e ° Ys 2 vertices have dagoe 3 and 3 vebices ° had have degree y+ ts ICI ACs tea) te, 2» %, dea(v) ey Cn ey Cy Cs i. Becouge the “am oP the dagrees of the vertices, Dis ge -ox349K4 - 6H R= 18 60-4[Aull Guophs a giarh Getwe) tg sath to be null Geach © so jexfice8 o,band ¢ aX iP co gian the below example , verti : a Yet connected taith and edge a thee i 1 aly “that 78 the graph hap re edges. 99 this Groph is a Tull graph» a0, 0 hivial graph? 4 null Graph Ge(¥.2) 6 Sd to be otivion Gray 1? 1 hag only one veux ord No edge. The dioga ctibed below diagam of trivial graph is des ee : ‘eck vortss: a. hag no edge 8 thig gtoph gaiviol grt imple ghoph? A Groph Gee) Is Simple Graph iP it does ni Contain any tyres a faopS and pastallel ore 8 multiple edges: b Here vertices ‘a,b ‘ola not cont ony types ob (cops and rnultiple ea Cdges. So, this graph ig ashe gop Muli raph Gr(yeE) is agatl to be rout ge ie a fame sels OP Vorbees contain mulépla edges, An this typed guoph.iwe can fam a. rvinimusn 4 ore bop 81 male thon one edge. Muli guy aR —). Qs . i Welices land 2 axe Conrecled isith rite thon ove edge. 60 this Groph is 0 mult ~ grarh. Dinecled Gaph2 Aw gorh @-ly.e) 18 aSeid 40 be inches Graph 4P % 4s made up of a geb oP vertices Connected by edges,%n which dhe edges have a direction aggodatid uth therm undirected graphs a graph Gi=lw8) ip Soil to be undivected graph We & 1s made uP of ast of vertices ard gome dy which axe cannedid by edgeg . the vertices 1,2... axe comedic by edges and hove to dinection aggecialed. ith ther et ©Walk? A (ool oP gph °G ic dened. as on olereliy) length de a rath! the no.d- edges i apath i8 called ‘sequence of vertices ord edges Wyle My Seep nin the length of apath . Glaxing ard encling ch vertices Such thet Gach | sobs an alge hich 12 rh aglfolo 1S a Path Ine @, f inetlend uth y. A walk Joining woond wis OF length one. : . Called Ven laalk . pie can be Induded anal but not air “contains only sige wes Sich verte Such toalk path: 8. called +4rivial toalke Pistance bin so vertices sThe diStance by L100 i “res ao na Trctls A walk 18 called abet! all Hs edges aft distin vertices na graph is the TO de ayes 5 hotest seninecting thom. ‘Poth? A walk ts caled arath iP al vertices oe distnek © Pe closed path? p closed path «Is apath that stants ont q 7 ends at the gare point (Gl) vere Gea ee a 4 GieuHls A circuit (31) cycle fg’ dapined a4 aclosed path : w 7 that does Tot contain repeated edges (distinct edyes) the distance’ blo the verbces ke%y Is tian because ew ey the ghatest path nom “toy is y aveVy A . Find the distance blo the vertices a and Cin th 2 ollovir et louirg graph. sd | Ve nes vy QvieivaeavgesWeyesvees Vg axe (aalks ; 3. o 4 Nene teat els ieee There ase ee a veiete the shBkest path MEM M Cvs eavaey 1S acbsed path fom ot ta eters : 5: WCMCRVyey%5 6,Vae¢ 18 a-trail if ci alc or afc. thus the digtanu 6. vq Yemen the veslieg aand cig 2. a vey eaVsCrmngy, axe Cincsuity aJ Fri tke distonco, blo the ventees aad 9, the adjacency matiis of His, graph is | acs od _—| = df g tha There aye a tetal of 4 vertices. from a te @ is ac. thus the vetoes aand 6s 4 | Find the distance blo the vexticas and ve the shales. path digtance bio the S Ward v4 is - 4 ke. & Find the digkance bla the veoiblees vi ard Yq . Atllo Adjacency matic db a groph Bt © let Ge(weE) be a simple graph such that Vofy.vat aan =--Web on Ee Genes -- Ge ten the adjacency foo Maibin A=(aa)nyun de bhe Gear G is dlatined 4 eLo 1 Oj= 1 4P the verke vy is adjacent to vertex vy and oy -0Find the’ adjacency rithie lleniing — grophs “1 rtp *f ° wi sD. * 3) wipe c ° £ Dia the graph with the meatus isfo 1 | tol a) ° x oo 5 eo) ° P-L 9 ® far the eo tO | hort ; Pote tik the adjacency wosljse Ast 0 graph with eo 1ol Vefuz} ond E+ faysie,2e$ 1 ol o ot on loo ide Loo eae ont yt ' o|3 fore 2 3 1 10 0 flo. 00000 1ofoo 10100 otlor r1o%O fb es Bidens? bhedt adjcere