Scribd
Upload
13 views36 pages

DM UNIT-III

The document provides an overview of various types of graphs, including definitions and characteristics of directed, undirected, weighted, and bipartite graphs. It discusses concepts such as vertices, edges, degrees, and subgraphs, along with specific types like complete graphs and multigraphs. Additionally, it touches on the adjacency matrix and handshaking theorem, illustrating the relationships and properties of graph theory.

Uploaded by

kaviyarasan1907
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
13 views36 pages

DM UNIT-III

The document provides an overview of various types of graphs, including definitions and characteristics of directed, undirected, weighted, and bipartite graphs. It discusses concepts such as vertices, edges, degrees, and subgraphs, along with specific types like complete graphs and multigraphs. Additionally, it touches on the adjacency matrix and handshaking theorem, illustrating the relationships and properties of graph theory.

Uploaded by

kaviyarasan1907
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
You are on page 1/ 36
UNIT- Graph. pee Basic Oeinifton Graph. a) Graph (= (v-E) comsiata Of. non EMPHE weet vs Callecl the wek of “ehioes Cnodes. points) and a Wet E 0} ordered bY Unordeved pais o} Clements OV, callecl the wek o| edges. wuch that then 14.0 Tapping From te wet E to the Set of Order Ov unorderecl paid o} element of V. Tnddent edge. an edge e14 Maid to incident on Coch o} the nodes u 2° v Th tonnecks them | Adfacent nodes: The fair of Nodes ULV thak ane onnected by an edge Owe. callecl adjacent edges . Fwolaied node: pA rede of a Paph whieh fs not Odjacent fo any ctnen node is called an iotated Node . Nu qaph: A giph tomfaining only isolated nodes ‘5 calted null graph. ed Ww Divecled Qaph: Tin qaph = ve each edge. eer io sedated with’ on ordered paiv of vonbirg then is called ao divected graph or Aigrapy, Yay tye X wv sree anh: 34 each edge 8 anoctaled wilh ON bordered pair 0} ius 1 then G in ON undiveclecl a one j ay I. fl Joop; An edg 01 & Graph that Joins a vovex to asl iteelF i calle q Nop. SS Parallel edges: Th, ino divectecl or Waivected YaPh. wniain pois 0} vertices are Jorn &~ Move Than One edge such edges. one called) “Parallel edges . Distinck edges . Th Case 0} divecled etges the Hwo Powible edgus belween a Pair 0} Vertiees Which are Opposite is — diyectin ane tonaidored distine | we . ’ LOS % 4 Reo aaat as rsa Simpre Graph: Aopaph in Which thane is oO the edge beween 0 Pain of .verbiors’ tn dalled (B-wimPe: graph - ‘ pai se y MS ™mulligraph A Qaph ontatnt vom Parallel edgta is called Moullignaph 1 kK es undirected Diredocl mull 'qyaph mulligra ph PreudograPh : A graph tontaining loops and Parallel edlgcs is talled @ The wdbgraph weighted Graph: Graphs in tohich a number (weight) 16 owsigned to each edge ane callecl weighled graphs eae of a Vokex: The de Of @ Vertea Th an undirected giaph 1s the number 01 edges tnuident voit ike The denoted by deg Cv) For O° leop,tor degre ty 2. Pendant vertex: Ty the: ch ol a veVien Is one it is, Glled Q Pendant ee t “Th- a of ve Tn a diretted. @ Graph The umber 0} edges with Vow fmeir terminal io called the Mn deguer of vane is denoted a5 deg- (v) out d 0} Ve The number oj edges with vas The Initiqn vertex is called Mae Out. degsee of v ancl 4 denoked Qs dog trv) For example wmider the Aotlowing Arve che} Snoup a+r 2 Th, of Verbeors deg (ad=3; oleg (b=! / dey-ced = 9; degta)=! bul} a O} verbs cas: clegr tb) 9, deg? te)=1 ded form peal gimpie graph : Temprete Harr. A single graph in Which Mere ‘8 Gacly one edge belween each pay Of disling verkion is called «complete aph , The Uomplefe gnaph on n verlices is denoled b, ea. ; i Example - . re ‘ 7] x mre Sb Bd & . 5 STE. The number Ol edaes in kn ts No or Do!) Henee, the moximué Number of ed 2 . ing. simple graph with N velice 1s ntn-5 ae Jz Regula arn. 7 every Vertex | a wimpe aPh hor tre sont Heaiee then the aPh i called @ arguiay Paph . y a verter fo ag vegulay g1aPh has the wiane degern tien the graph ia denern Gaile hh ~veguia i Example : aA | (2) 3- regular Qaph — Dax [Q wr ™~ Bipoalite Snaph T Me vetler vsek v 64 vsimpe PaPh O= LV «ED ean he ponkihoncel ini #0 | jwubselh vi nel Vo uth thak every edge 0 [Connects 9% Veter in Vy ancl a Vertes in V2 Ls “tak no edgy in Vonnels ithe, 2 verkices in\i ‘ov two vertios in va) Vien & is called o Bimslile -Qyn0h - ry] ptample-"| 7" Faryad i womplelely Biparhile gray q in alti Sghes is nnected Wilh every voller of Vo by one edge Hen & ip called Complelely Bipaiile graph. 3 Wi Mniains verlies ahd Va wnjains n Vers OFC Lomplelel Bipalile Graph ia denoted by Komi n - Fample LK, 8 6 ' 3 k3 groph ub graphs: Sub graph: A graphii= (VE "Dis called o wub Haph of = (weds 4d vic vand eee | Paoper Subgraph » T] > Cv! rE! di6 G vubqaph of 1h: We) and 4 vrevand e'ce Men His ‘tailed Proper subgraph o} rr. | Sponning Submaph zy = (VES) tO vub \ 6 wae wed a diy then Bis mea “Mpanning, yubgiaph of 4 nA “pormnrng, wubgraph ho not contain all is edges | Vertex deleled subgraph : | T we deeled a viubset U0} v and all the | edqo inidem on Yne elements vi U froma paph |O> Vee , then the Mubgiaph C~ V) io Callect |Neskex geleted | mubgopn of | 8. t | ote © Avenrex delet ° wwhgiaph 6) o Feige deleted! Subqraph 7 T] we Ba a wubst) Fol E ftom q orh Gt ved then the ‘oubgiaph CO-P) iy Htalied an edge, deletecl wubgraph of o. BK Ne soy Edge. ddeded: Groh Of. Tnduced _ Subgraph, Wubgraph’ H =(v!, £9 of © CViEDWhoy MEV and & * consist 6f only those eal that exe muident on the elemenk ov © in Called On Théuced “ubmaph of C, h AP A ’ BEN: wy <{ V/_* snducer. -granhol D a TromerPhit Graphs: TH Yaphs Cn and o2 om bairl to be Taomorphtc }o..coch otper, 4) thee 2xials a 1-1 tovvesponclence between fire vewex viele wich prsinves adjaneeney vf, Verlites et Be pts ys! i vas Nay) 244 | | of Sei a & Tob, ye YD be ; Matria’ ““vepnesentalion ©} qaphs Ad fanitay ai whn is % winple’ Yaph with n° Volos Vi Vo Kn fhe mains B= Pay) a ry vy Me an edge o/ wher aips 2) Rea 9¢ 0) 0 is ta)led the afjancy matrix oj | Tw 04 4 Nove: WR COM lind Adjaney Malin 4oh all Hypeoat grapes - Tnddlence Matix: Tw (ve) is an unclivected, graph With n Veriors® Vir My Vn ancl m edge @ 129, -- em 7 Hs when edge ei "6 Nneident 8 [bi where yeeaiae TED WRN ij ia tolled tye fn wadin ol thé e Inidence Atlewrine which 0} te Aoleyang paps axe Dipantite or nor i Wwe grape 1 ia wmpletely biparhte.. bipantike tate 4 The isan edge between hwo Volics cand, fF in the wane vertex “ek Vi “This ts hot a bipartite Soph . 4 Thaw exis no edge betwerh the Volicn of the wane vel The exis) venki: edge between Vorlions of two wets Via ve Tt tn O biportite but nol a tompletely, bipovtite “qaph becouse totatvertices in Vi connecled with, (a). (\. a tae Velicrs: in vertex Vi ane >» Connected with vertex ¢ in v2. re ‘This cpoph is omplelelyp jet 7 | biportite. ley U Aa 20) There ia an edge belwern Jour "SA ja] vets cand “py Fr & in Me | 2 TMs a oF 0 bipalite paph he voniegs inaveslins in vertex yi MW Lonrucled with oll toe Verkies ink Tia Completely biPortile paph. 2\, The exist no edge bekwcen verkices o} Somme vcr. There axis edges belween ee Of Woo sek vive , 14 a biportite bul not a A itl biportite graph be cause PO! all) veshices tn Vy tonnectedl ‘ With We The vellion in wi with vomected vorbicn in Vay “not all. | This a bipoviite Graph, ota complelely bootie qrath i e Ha {Shaking Throvera ‘ Stalemment G@UviE) is an undirected graph with 'c “edges, » dwn Zdeg or ; + ae i * Te “um o tne degre. of all the Verliews of an undirected graph Is fwiee te number of edges of ph i 1 noo Sine every edges incident with, exactly 100 Vertis + every edi tontribule 2 too the Wome Of te Segue 2} Verbites ley Ved ver Vor. Yn J be Hey veer viet 2 deg Cv) s deopne 04 deg tvirsd eg mapas degen) 2 sates. 49, cmap | ibe Ae | The sum of the degrees o} a tee ‘ences in an wnsivectedl qsaph is wots! the Number Of | he lye o\ the parks 2 Show thal the Number of Vertives 0) all dere i tn} an Undirecied japh io even. let Gwe) be an undivetted graph | lek Vj aM be wel of ‘Verticgs 0} odd degaec and | | even deqrer vespectively - by Hand having theo, 2 deg evi )- 9¢ = . vew eq tvae ea (vy > ae 1 Vey deg cv) + even number= even number on deg (v)= eH number - neven number: even no, | ep VeVi a el oe - numbr : Sumo} even Dumber of add dear: even : ‘Thomane even number o} odd degue volbias in an undivected Qpaph TON the vertices of an undivected graph ane each 0} Odd degree e, vshow that the number o| edges Of Hae JAph 19 a multiple of «. By Wondahaking thoven, < deg cv) = 2 e@udherc vev ea number o} eclors Dis given that all the vatioes.cne..0} odd dxgrer k 8 The. Parviows trrovent themone even number o} Ce degree veicus in an undivected qpaph et tobe a @>krks +k an Hews = 9€ tnk- ge e- nk : weld Te number edger equal to. multiple Ak, Tw Dumber ©) edges = 0 multiple of k How many ed OM thee in @ gyaph with Veins ath “of degur 3 9 Given, n= 19. vali), Pr each ¥ely Megiv d= 3. eohee EV By Honahateing theovery, . dug (v= ae 5434 +10 tims = De lov3= ae ; 9050 ' Jez Tey W pan MA Ho the number 0} edges @= 15 - 5 An undirected raph c hoa 6 @ ventions A of degree 2 find He Given [© = 16] number o} edges e= 16 For each Vvev, deg (Y) -2 By handshaking theoveve & deg (v) = de MEV and ol) the wumboey 0} Ventioes Bt are +N times = Ox16 “The number of vertices We 16 Twatrix “uth that de | A=%3, Bis an odd vertex, Geqe 0} c= 2 ‘Gnd Band & ane adjocen! Given deg ca) io 3 Bin an Jo Odd vertex » deg tc) 2and Band & awe adjacent aget— akc Sine A has % degper, join Awith Bc, E- ee Since E and Dd an adjacent Draw and edge between dD and E Since degree o| tina jom ¢ with D That is no more edge al 6 became Mae degre is an odd number - F i wit Vertion ~ pli fee ag ae eae ge jo 4, 9,35,475 . Wy 2, 3,404 \2e Br 4131 4ar3 GBSLS nol wlaliay the Vardshoking hovers 2deg cv) 9¢ VA age are 15 \ + ae Moto even number Thor ae 3 odd eee Verkions 80 couldn! dhow 0 Simple undivecled Japh qaph 2- 8) The Ht veller in with dagver 1 Nosh too Verkions Wave daysce a} Tt dyaw A edges at Morse two vakios. be may have the deyrer of tw {inst Volex hos a-, that but ikis | hee ¥ Tr wuldn't drow such a graph -* 7 Ph Vs ‘ Becst not whohisly the Wordshoking Room Z deg tv)> Qe 344434 443-19 14 de nol og eth number Thex ane % odd Arqer vericn vio wuld’ draw a wimpre undivected raph graph 4 ‘ » By Havdshoking thepvena "@ 8 Zdeg wy= de 0494 244-9 B= ae ond also we con drow o wimple. undirected 16 ar even and Ako Ther are two edd wrt. tla — —————e oF qrarh 5 . we couldn’) drow a imple graph with deque ! Matrix vepacsentation of a graph Inudence Matvix : T] G (ve) is an undirecled graph with he Vertis Vi. Vo vy and om edges ei eo. ems then Mx Mottit B- [ bij] eohene biy = \7 big =) Wren edge ej in indden} on Vi © othnwise is called Wwe incidence mattis Of O- wf Reprwsent the following qaph by twe incidence matrix © ~ 8 ef 7 en & 5 7 } & les e on O's ow O2 es ry oes € e2 @9 ea @5 B= af, 1 0 0 0 8 1 o ! © 1 elo oo & ! ' ps0. wt, Mayla? © @ e@ e3 ea, e5 &% Bor 9 fr 1 1 0 © © plot ' ' 0 1 c ore 10: Ts ¢ ° oO 1 ' ou! oO o 0 0 Mon Draw te graph vepaesentedl by the incident matrix Ae a 8 c o | Son: Tsnmovphiam % Tino hapa cy ancl toy are viel to be a * foeach offen i) there exist a bio! a bbeween tie vertex viel whith Preserves agjanceney of te veins ta. Show that the raps ane ‘Téomorphie IX Solu: metnod 4 A 5 403) oN @) DN V , ba. ! > ew a be Tn both the Gaps ar ond oO, the numbey 4 VeMiogs = 4 ancl tne number of edges = 5- The degree wequence in ty 3, 2,32 The degre wequence in 012 3,2, 32 Asa Bab coe Dod | TH Maphs aw Tromorphic | [omit wit e Toeuing” papi etal 4 nol Tsomorphic + give the thoes , 43, aN e wid as € Swen 7 / oe } / a “ate vs ey Tp Parh G) the number o} vertices i» eal fo 5 Im number of edges = Th graph H+ the number o} vertiors is equal los The number of edgas =6 Number 0} edgus ane clifexent ih both tre Siaphs Ao in paph % the Vertex us in cafe dene 4 in graph Ho thew is ho uch vetex The Paphs are not Csomorphic of vortex va. Examine whether the Gpaphs ane “Tgomoxphic or noF MO) vad 1 Os 98 % Viva Ve v5 ve vp J Or V5 My Sal : 8 95 Ue ye vy ve YS vy vy . 45 eo EP oO 6 Roar wy Me & “og, oo @ wo 92 dy An Gaph G1 the number of Vertices is equal to & ‘the number of edges: 7 Th graph Go 1 the number o} vertices is equal tos TH number of Udges > 7 | Tn graph i+ the vertex Us is of cleque The Adjaency. vesios Wa Usy v4 ar having the degrees 9) 2/1 Wespeclivelyy « | |Th qaph G9» the,vertios Va. and Verb] degier 3 The adjacency Vertios ©1 these, dwo Vertices have the degue viequence 11119 “40 "5 Establish the Taomoxphinnn o| Hye following Paro Graphs by towsidering, They adjacenty matrices Soin» aCay gta) — 815 Wid Lo & oe bs + 3) A 2D 5 ay oA, L/] 3) ee mo Ga ve? : Th QaPh Gi the numboy of vortices = 6 The number 0} gu = 7 Th ah C2 the number of Vertives» 6 The Number Df edges = > mam Ets vy Us > Ve Ug> v4 , Us> Ve Us—> Vo Mpa Va Ur Up U4 U4 UE UB fo 1 © 11 0 AG s ly 6 1.60 0 0 wl oo 138" ole UNV. Os aie | Ma}. ay 050 vst 1 Dijs-e OVO hi i uy mae | ow hoo = WooVg Ya V5 Va V3 Mi oO \ oO 1 \ oO Yo} ‘ oO 1 oO o ° wile 1 0 4 Oo ! wi 1 o 1 eo 0 0 pans o 0 0 © } Wh ° 1 6 1 9 [Aor = Aoa| The Maps an Tsomor phism . % Establish the Tromorplism of the Jollowing Pair of | Graphs by wnsidering they adjacency © malricn . / é H Yury sup AED Th Yaph the number of Vehices > & The number 0} edges = 1 Th qaph h the number of Ventices » 5 1 The number 0 edges = 7 | mapein wo ) Us SMa | Us Vg | bi yoo VAs V4 a US > Va A sur b ' o 1 o ay g yo dt “) 6 owl “ls h1 0 0 3 oO hiro 0 Va Vs wi YA V3 Pye fo 1 0 10 “5) 1 Os i¥< vet “ 0 1 6.1.4 ‘aq 1 1 00 cam 1 1 06 Ao= Ay ae The raps o | Eremine Whethen the Graphs “ol tae Ablow Se matric ax Tsomorphic oF not Ur Ua Us UG vi nV va Yas %. Vopot “fO 10001 i 4 Jn boin the Sapls the Number ©} venkeeg, and. Th number Of edgn ane vome an band & AN The vertices “fn both the graphs ar havingtne wiome degree wequente. On veing a gpaph o%ord Que not — Tromorphic - wince Tid adjacency hot maintaived here meth Cping Permutation Maty Theorem Statement . Two Graphs tm and G2 with adjacency malin Ai and na wapectivelip ane Tsomorphic i} and © 4} then exist o pomutation molvix p- Such that Phi pt = Ag NOTE: A matrix whose vows tf te unit matrix but NOL necessary’ in Meiv natal order 14 talled a tation —moalrix Ww The adjaceney matrix ane of & paired Graph Ore ov follows - Exaihine The Wsomorphiam 6] cy and G2 by finding The , Permutation matrix ire < foo i orn "By 0 01 >> Bode") oo | bb 0 109 degree degree | oo. VY ov yo ras 10 01 fo br 0.0 | t= naz roa 5 0 Oj} nit matyi. Of Order Pevmutatvon. malyix ol odes Yoo 00 = Prypt = Ag Bu The Yaphs ae isomorphic Ter ~ 19. The adjacency Mmatviow of Paived graph are os Jollows, Examine the ‘Téomovphiam of Gy and O19 pinching the Permutation matrix Am- fo 1 0 i ove 10 o48 Ada = ooh o 001 Vaya e 1119 deqyee oe fare fo y oy. oe oe raja ae 'eor]e Voorl, ooo1}4 Voor], tv vols Yv1 oO) 3 From the Adfatenty motricns Aa and Aaa» the Serer 0} The Vertiers ame 69/9/17 3) (8/2/23) Yespectivel 4 The degrees of different in both the graphs, || nok oatchin || we wur Rot Jorm a permutation mabkr'x 2 The Graphs One nok Taomorphic . ‘madhod 4 | Te ee 1 ae, be, Laden. - tou beatin TsomorPhiam by finding te Ureils OY Cruaits and Taomovphiane J) two Maphs am Tromovphic They will wniain ” Uywils Of Mame length &, were k>2 Bo eng aay Examine whether The graphs Oy andae ow * a ‘ Eor Wp. L kod toe ts, a0) / Omorpic or hot ZS Ex | Solin = uy _ IX | rd ZW In both the Ovaphs &1 and Og The number of volios = 4 and the number 0) edgu = 6 Gis Ur-Uo-Ug-Ug-Ur G2= Vin Va -vg-Va~ VI Th Graph On, Ui- Va- Va~ U4~ Ui To civusit ola Th raph GA, Vi- Va- Ve~ VA~ Vii in civutt of length 4. . The both the Qraphs aw having the druulls o|_wonae_lenghn sto the gras ave Trower Fhi< Using Urwils © Btomine whether The gpap hs G1 and ane “Tao morphic ov nok + { | | mo a Sala : al) ata) SFO Go ‘In both the Graphs Grand a the number Of vonlicas Land the number 0] edges 10 | Gis R-B-c-d- A-@ = Ga: a-b-c-d-a —@ | E- F-G-H-E -@ e-F-g-h-e —@ A-B-c-n-G-F-A -O a-b-g~f-a -® A-F-E-H-c-0-A-O a-f-e- g-b-a-O A- B-c-H-E- F-A-@© a-f-g-bh-c-d-a-© a-f-e-h-q-b-c-d -a-® Tn @. Wwe Gronity 0} Jength 40 but in oraph W. |The crwila o} \engta 42) Int, the Uruuila o} length 613) but in onaph H the Uvurils of length @ (2) * Tn the Uveuils of lengin @ is thee iano [Much Uruk 0} \engik @ in G. 5 Thor Nhe gpaphs ae vor Taomorphit - RET cee ae } Delinikion .... earn — Aiernate, sequence 22, A poth ina Paphisiniie allernating, wequente, {OL Netiens and edgis » begining and ending tfth Votis “wuch thal “edge is incidéwit’ ov the Verlices Preceding “and Adlowing dog. 2 Example: b aN J the edges in a pat ane distinct it tn called a wimple path. elem ta sada Cage alg Fe" it Vahye a a 6. ae °. tsomple:°[S i a-b-c-d gee NN Jength o| the path, (loar germal o¥ Simple The number 0} edaes ina Path is Callecl length of Rade fe a-b~¢-a-cl-c d Civuit ov Uydle oy closed path ov Closed walk T} The initial and jinal venlices of the Path is vam, [ a-b-c-d-a k Simple civeuit oy vsimple uyde - T] ther is no vepelition of tral) edger Ina Ciyouit ov dyde then Tt is called vimpie ciruuit oy wimple Cycle A) tex viequenccs OM Find which ol the Jotiowin “vertex viequentys OK vitae Path » atts mr Paty and Simple drusi with respech to the Qraph - Aa there is no cage belween A and Bs Ths Mot & path 2. simple poth 3. Path edge A- & ts vepated twice there ls ot Closec path 4. Closecl Path 5: Simple path Eloy edge tuleian “Grape Ckdge exactly ¢ 8 are} the graph © is called a Euley a na 4y Liv is includes gach edge of G exactly Onec leulewan Urcwlt or evlertan wycle- | A Greaiy oy tye of Graph ty is called 0 Culetian Quit Tk ifcluder each edge Of 0 exactly once Eulerian Graph Tho qaph tiniaining an tulevian drut 1, Called in tulerian Gvaph Ex Fulevian Path : tiruit and Graph = 1 ] A-c- B-A-D-C (Pate) no Eulerian chvwit 4 [ | ®&B-p-¢-B-E-A | Corwi) t NO Eulerian Path . Find theorem vilotement | The Moamary and viullicient tondiion Jor The existence of” euler urwtt and Euler Poth A unnectel gyaph contains an Euler duit and Only Yo each of re’ vertices are of an een de shot we DX, 4 * Whnatled Graph vontains an Euler pata ‘Vand only Y tt hos {fxsiily two veaticen of wae 28. Fine an Euler guthov an tuey Unit 4 ihe ee in * each ob the Hirer graph given Yt does not exuews explain why? 04. $Reae | { $oN \Y Any | am Gray 81» The Veen A, ond Bane Te only” odd degree Ventins Graph Gi walisty . Mae racewory and iuftidient wonditfon Jor. the cathtane of on “buler path « The fuler path in A-0-B-c-D- E-A-B Tre estist ho Euler Gvuit ®@Im Graph 02, Ol te verttoes ane O} odd degree , Wo. the wnecewsory and viujjidient wnditonm Jor the Lexistonte of on euler Path and Euler dwil am Dot. voattalied | Thwe is no Euler path and no euler dvuil » (© Ih Graph 03, all the vertices ae of even degree Yo, the Graph O3 wally the meomsary and jMuljident wndition Jor The ettslante of on tulerion | Urea. odd depres ‘ mee 8B a [ A -B-C-D-E-8-A Loss There 4 No Homillon drei anc 7 oe Ewerian duit. Aa id ho a6 Theorem -1 To graph Ceilvey cormecled oy Nok) hos oath 2 i Venti of odd. degree Where ia Path joinin | 8 vestions. ie | Proof: - | case © let Gy be wonnected Hpac dernnd “2 be the only vertites of 6 which one 4 3 (Odd degree. But we have” olveady prooved that tae # [Rumer “of odd vertites 14 even « eovly there 14 0 Pall | tonncany vi ond vp, sinte "4 conhated. “ME ® eb O be disvonnerded Then the wmponens of ave tonnerled. Hente Vian) should belong, to the vor tomponen 0] Cr. Henee . thew {0 0 Pal between i Ond va 87. Theorem . 2 - Shou That, maxi mum N0.0} edges. in (avsimple dis vornetted QroPh G wily Wi vertvors and Kk) Completes graph in Min), 2 Soin: TY] graph ia a wmplele grph , the Saph will have the moximum number ol edges. .. Sincey avery paiy O) vertiow in O vomplete por 1S vonracted on edge This tan the done in neg ways. “The mortimum Number. o| edger th on undirved PAP neo = nen") A. Theorem - F TH, maximum no. of edges’ in a wimple diswonnecel Qroph G with fh verifos” nd k tomponeni ia cn-WO en KH) TT Pee Proot : Jet there be % wmponents. ° er Tn each, component » there ane, Dt erties 72,2). inl Sum o} the Vertioes 0} wmponends = no. 04 Vertieasi@ 2 Whe Noa-e + RiF aN REH £ PCs aansabe42e Corbye 2. haa li nk). on onk 4k? k = (M12 OZ Cpt) Oj 1D 2 ND ake gk? iy iy Deinitely aihatnen of LNs is zo x 2 Cni-')? 2 n?- ana x2 i oniat) €n2-ank +k? K m2 22 anvaee SDs ny - e4 ie i x = nj2 kK = wg of al Npeemiees 72, prtni- DS Tan k x pent Le wt et S nia ae is i 2 < gen? ane ke aN-k) > i nk 24 (hk) By ® = yp CH ons + kane kJ > Stn Maximum no-o} edgu = L onaky tne kt D * No 4 cays 44 Oe bin wo Enka 1D the number 0} paths Cae any 2 Vertives . Theovern a Weve the No. of Paths 6] length 4 tom the vertex D to tae Nolen Ein the undiveeted “Gnoph given analytitalhy: Tenbiv,® yore patins trom Mve graphs . "i * A ae }. E The eee yep. mabvia 0} the given Graphe + 02 le so cK bli ot os OFF 70.ek 4 2101 07VFo1p10: P |r or oo) malisie (sera: rly ts %o. (gett eae’ | By moivin multiplication, a2= (2 9 29! If osrat beh avsor | oR 024 | { hr tae | Again by motia muttipwecavion » we ge I FAR 05 rn | mAs gf Bo ub | B\3 B 7 ne 3 | c]n oa 5 3 8 | | pii us 4 6 i 6'(. 8) 85,8) 6 ey | | | The to. of pats of engl 4 From d toe = The entry in Hae (4-59 posinvon of HA To 6. | Nene tere aye & pats ‘dentitied rom the quer |qraphs On 0s plows a 1. DP-A-B-C-£ 4 D-A~D-¢- a wat: RTE 5» Det- BBE | 3 -C-d- CE 6. D-C-B-cE 4tdges = BN) Cometednens in direct graph = oe ™ ghrongly (jomneded | ‘A diveted graph is vigid to be varongly. tonnrc tne is 0 Poth From Vito Wand From viand Vi » adhere vi and yj aneayPaiv 04 veriicrs 0] Te graph « | Weakely vonnecled . | A divected gvaphe in vaid to b! thee io a path between ever underlying undivected graph yy and only Uy there east P path every two vertives when the direction of the edges ane disregarded . Unilateraly connected - A wimple directed fraph is waid to be Uunflaberaly Graph 4 Jor ang Pair of vertices ,atleast one | the vertioes o| a paly io veathable {vom Yne other. Nore: A uniloterly tonnectedl graph in weakly ep weokely w@nnected jwo vertices in The wonratled , buka weakly Vnneled graph i4 ho neccowarys a unilatevaly whiecled groph- . A vitrongly wnneted graph is both unilatera and weakly wonnected . ee gg so Find whith o| the raph is shongly» weakly vunilaberdy convecled om @ a een % | | © ° c ° ®., an @ 8 eB k & aa Laie Viecmhioht { ‘ Ht | Og Oa {Pair path | new path, ey ge [QO me \ | 1 | Ho) > | ee [Beem a oP esi | Caos AS] ade] || HOD] de> | tere] | ee fe eee | Boxe |< | [eo we cer8)] Se a ase Buh | Unitanes i and ao | |e | . Mateval and ao t weakly vonnecled Biba fa fey) | Covey | => | <— “1 Shrangly conhetted P| path [spate | i = ze @.8)| > a (aig) > — (ye (BO) Sv ee, (Bin) ss ees => fe rrpepn tert | 509914 tomneced tomponent of G@ ca vubgraph) W iuiograph of di. graph G ia wshrongly vonnected but not wnneted ina larger virongly toninecked) | Mubgrephs “The maximal vihvong) yy Wonneded wubgratl [%s called te wshongty Uannxcted component as 31, Find the wlrangly connected Conmronet of a graph = * Pay boy te yoo4 e el LE \ F . oe | The Mubgraph: ABHT and COFG om Ihe vibrongly Connected tomponcnk of @ Qraph:. SPT] a graph Cater wonnecled oy dvswrmected ) has exactly hwo vernites 0} odd degree Wren there 1 @ Path fining There feo ° vertices casei: Jet G be tonnected Jet Viand Vo be the onky vericrs 01 G which cue of odd degree. ; cleavly there (4 @ Poth tonnecting viand V2 Since the number of odd degree venice in agraph ia ever h yee li Let G be distonniccted Ten tre vertions of a womponents 0} Or OM connected. 4 Then ws and, vielong Ye. fas mame wmporsnt Hente there is a path behwern vi and Va Coy tose ye a sel o bea winpple undirected graph with n vertices. “Jehu avd v be Fwo (2) Non-adjatent vertiees in * | Such thot degyer' of UU)+ degver of (vd yn. Show Thal Gis vamilvonian 3 and only 4 Ga uv iaRamiltonfon || Proot . | Parti: et Gr bea Hamillonian Graph - le uy be any Path in dr. § Sine. there. wiay be Move than ont Haniilfonian tivwi} inG, treuy be 15 @40.a Hamitonian circuit -_ Pano: lek G+uv.be a Hamillsnian graph - We hove to proove thal is yamillonian » wuppore G 1d not a Hamillonfon Qroph There i no Hamiltonian Orwit in & Tren by Divain tnovern,” Ty & fo 0 vilmple graph with pw verites, R23, Yueh that degree 94 « Pvery verter ta, G Th alleost By then O hos o Hamiltonian dveuit ", ~ deg Lu)s deg iv)

You might also like