Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
48 views
42 pages
Module-5 Introduction To Graph Theory
Uploaded by
KUMAR RISHAV
AI-enhanced title
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
Download
Save
Save Module-5 Introduction to Graph theory For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
48 views
42 pages
Module-5 Introduction To Graph Theory
Uploaded by
KUMAR RISHAV
AI-enhanced title
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
Carousel Previous
Carousel Next
Download
Save
Save Module-5 Introduction to Graph theory For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 42
Search
Fullscreen
ven ong fe be- jwern| was, rupute > Tmbeduehon 1e Gvaph mboduehon Te Gnaph “Theory Chop-o4 Tooitanaphe yi figigotane ae Directed Graph? A directed graph er digraph fs a parr ve where Vis a nonvempty set and & ig a cet Ji ordered pais 4 Element 4aken fom @ get V- For a dinected Qraph v,£ +he element of V a7€ called Vettes (udes or poinu) and element of & are called diseded ed a > t The set v Ts called vertex cet andrset @ 16 cabled 7: Anerted eda cet - The dnected” graph V,E ts alco cunold D=CV,E) Or oty,e). The qeememcal fiqure that depicy -the aoe graph fs called Seaguam a directed qraph- = = The above fique & a auaguam of the rectory yah for which theverter set is ¥-[n,8,¢,0 ana edgy wt is Jona), cA, 0} ae In the arageam of the directed quaph the divetted “edgu mud not be shaight Aims segment they car ae carved Hnesor ores also Bal A anected ed AB of adivected giaph can be sepusenied by an arbi hay ore dia fom verier A te verter & Pane fas Versices of the diseched qraphe are cunoid by th Upper oy dnwer case letters Lh ABs 6). - =) Or WY y--- on by letters wlth aufplees appencdil +0 them like Mayas M5 s- = : iS wed¥|pee ee edge AR we cay that A Ps 4M tnittal vertex = Bic the terminal ‘vertex of AB or ad deme teeied ed im cx ctiqraph 4 the fnttial vertex and “he Nance vertex needa not be different - irecte edge beginning and ending at.the eam verles fis cunote. ed Loop - bY AM MA and re called: a diveted O A aigraph can have more than 4 directed the come fnital Verter and came ‘terminal verter edge haveeg Tuo divectedt eagu having “he caine: Inimal verter ond the seme derminal verlee are calledars paralll ree eaen Tuono of more diveeled edger haviexg dhe came inttral veviex. and same tetminal. veriex are called as multiple “ ees vealed A vertex of a digyaph which fs aacither ‘an initial vertex ~ mov an terminal vertex 6 any civecteot eay ie calle an Isolated vertex of thi "na h. 4 Ne : ” ae Ms A . 7 edt - ’ i Peolaled ‘vertex: In thfs- cfagiam -the verley'%q._'S an feoleled } re a ong to *be:.an initial verter finon feolated vertex happens eee ee i no t je adiverted ey aderminal aerex fr yf Laney a tevmival vertex for any : and anon %olated vertex which te not fnk. an inihat verier for MY diveted cdg 's called oir . Inthe above diagram the vevtilec V4 and vz, ce goure nn e and vertex V> ts 4lok: cthe verter Vs and Ye to any o| thts ca qe which (6 Mot called 40urce door mit belongdegree_and Usioe|s*: Wy Visa Mane 9} @ dtqraph D the number oO} A of for which fs the initial verler Ps called the outg 4 and the, number 8 edqu deqree oy ouldeqree Of 9 Ligue which nig the -erminal verter iS talled fn commin Or imdeqvee o\ v “he ouldeqree g) VTS denoted hy Ailes) ov odta’) and tndeqyee 9).v Ps denotit bg driv) 07 id(w): Ht -Jollows that Watta)=0 Hf v t astk Q)dta)eo Tf Vv 160 aource. - | aa . - (3) ata) = ola) 8 Pats an Peolated cyerter - fq: Ma, i ~ : wt Ne Ws , - | For the above diogram thé indegrees andl puidagrers . ave a golloux - / Slay) =2 ola) 4 : : dt(o.)- 2 do l)=3 . ditay)=4 dread © : : dil) =0 -lou)=0 3 : a _ dla) - a ala, et = ix : | omit San | “There Is adivected loop at vertev Vs and thts Joop wonbi bul, |a(ount 4 4p each of ails) and dls) the above dtoyem iss vertices and 8 edgu « Ond we obsenve Ahad the sum oy ouldeqrees & indugrees a) ib verhities ae-- = 9 Nay = ¢ ond Ee loes : gonek | a heovem ‘) Oiguaphe “theory. f lew every atgtaph 0 , the sumo ouidegrees 0} au vertices Te equal 4o the cum of iendegreet of all vertices each sum being equal do the “umber 9 eagan im oO. Suppose D has m vertees WyNa,---,¥n and ™m eg kk 9 be the number 4 edqa ge'rg out of M%4> t, & th mun ber of eagu going out of Ye and <0 on . Then AMovg)= 94 Aty)=¥g = =) AM) = Yon i ee edgt timinat: at come vertex and ence there ‘ ©4gn we should have Mig ne Auoraingty di (un) gattan)p. pdt) = 94 41% Simtlaily Pf oy t Ba Ate, atite, chest 4 Ps the mum ber a) cage éom ming ino %, Sp iS4he number of eagu ae My a ai then we get lay) doy) ne ng In mand se on, , Z Dope = OUU Ve Sg HEHE GH This: 2 di lag )= & oa )em fe Thre womplts the requixed proof - A]Find the Indegres and vutdegees “of the verhees of the olqraph shown below Va, Now Na Fiom the above diqvaph wenclithat ay ts Q Source and M,Ond y are sink. i ere We ales chek that cum of outdeqree> Sum of Indeqree =12- Mumber ol edau-Ahk D be @ atgraph with an add mumber of verte | Heach vater 0) D has an odd qutchgree, prove thal D har aaa number of vertices pith pda indugrees. ol ie Nyylay> +s Va be the on verter of D where wm fs odd algo lek m_ be the mumbey of edgu in © “then we have. tay idtlag) ++ + ad MMe m=O and d-lag id [aavt0 4 AV,)= m —@ odd ouldiqree tun he lejt hank m - odd oumbers- odd dbus m fs \ each vertex has sid oO} eqn @ Ss q Aumo Since n Pg odd +his sum must also be Odd. . e ks k be the number of verhees with odd ‘fdeg ve es then M-k mmumber of verit?s have ever Pndeqrees- Lit us Joke mig. Vy,-- 671 Me to be the vertices Ustth odo Pndeqrees and Net 1, Wr2,---) VA +o be the vertices with even Sndeqvees- then the exprecsion @ may be vewsn then D - os £ stmr+ gE, ,eew= om —@ f =4 fee+4 0. o} athig eF pression ig evel Now -the 3°4 4um onthe LHS Also m is odd. othe fied cum mut be odd. 1 Alay dad lade +a Mela but each 9 A-lag),d-( v2), + + ws jdV_) bs odd - . 2 The number o| terms tn tH HHS) expression @ mucl be odd te k teodd- this proves th mequired proof 3] Verify the tivet theorem 4 aighaph theory ber ne folowing —atgnaphs . d oN “a “ : Q. 3 ; 2 vy! u ~ Ms Na 797 bt ere 2 ta Yap conn? yeGraphs? A gaph fs a paid V2 where V Pg a non-empty Setand & ig a set of unovdeved pair °4 elements 1aker from the get Vv: Fea ger CME) the elements 9) v are called veri | element OJ & are called undirected edigts oF exqu- & set wv fs called vertex set and set € ie called - Sage 4et. the 9raPh VE Ps aleo = denoid by BME) oy Glue) ~The geomehicat figure That aenich Qa goph iS calkd ar Liagiam 2} graph &q. 8 e oD * A qraph ov aiqraph tontaining Mo ect Fg called wuct qraph. A NULL graph with only ene vertex /s-calle a hae! graph: ; a £9: A a ge. *c nu traph with Bvertices There can be mote than one Aiagram for the ame’ YOPh: Fer eg K 1 . i ® ¢o PD : o fare These two diagiams peprecend the Some yah since ath tomveys the 4am Fnfermation Mamet thal “thr yaph has + vets A,B, 6,0 with AR, AC, AD, BC and BO on eda: : i ne A graph vy diguaph with only a tinik number of-vertrees ag well ar only a finite otimber of etgu fe calka digraph or 5 finite “qyaph sage 1s ‘called an sink goaph or diqraph’ : 3Ostdey and Size > Soe " i “The number of vertices frm afinitr quaph is called the Dider of a: Yaph ov mumber of edguim 14 15 calls ity six. A.qtaph of Order A and iat mm is calud (nym)qeaph A mull paph wlth mverkeer is catia Cn,0) qraph End vertices , loop and muttip& edtgur a “The vertiter o} the geaph ase clenotil oy Ai BiC, + OT VaraM - andals the edgn of “he Gvaphby @4,@,,---- - 4 Vi and a; clenot. wo vertices 9 % Giaph and H & denotes the edge Joining eviand vj then “and ¥j are called On end veytices af Ve This is syimballicaldy Gancider the Jallowing graph watt n' 4 eer Lo yb: uy. tt oa en V2 Ne vick hak’ thts guaph ~conststal .g vertices: My aV3Vq and, & edger 24,85 10524125 12 as We abserve that the edgu eg1 ez, hove clistines 0 wvertivecy but the @ hac the same verter V3 &S ‘beth of Yb end verweer. re fg 9% 4 and edge £4? eg ig cated a doop- We also observe that the eagu es anil €,. have the same Gna vertees Vajvy 1€ est hYLIV4} anct 6 Levy My} » C994 Auch on these ave called pasalll ekgur laa aqiaph 14 there are » Qor more cdgu eis aame end vert ce, -then the ectgqu ave called multi Semple graphy mult quaph and Syncs graph: ro A graph which Avesaet contain ops ano mu : edg tg ooh Otimp graph: : dutinel endA gtaph whtch does mel contaim twop 41 calud Loop free quaph- A graph whtch eondaing multipl edger but mo tos pi Ps calkda mutt graph. . A geaph whieh “eontaing maul ipl edge ‘or tags oy both” Ys callid ginual Qrahh. - a a Vanes V2. CD eS. ae o ae. N: ea 5 Gimplr exaph = meant qnaph en wna ph. ' _Incidince! When 0 vertex Vol a geaph 1 & an end Vertex of an edge E of the Yih brgwe say “that the 2 @ ig Eaeitine On Vertex %v. i Since wy me evel edgy | has two end vertees, every eclge oe ridin’ on 8 vettices one at eath end: Le The_two end vertrees que Cofncident a — loop. the edge fs Two mon-parallt edgu aie sard 4o-be adjatent.e Ages . TY they ae Paint on © a common verter. The Avo verseen Cue Aald 4p be - anlar vertices fH there 's an edgy ce biG ; In the aie aan A and RB aie adjacent vertices and Cy. and Cy at adjacent ecg > But A and'¢ ate mod adjacent vertices and eg and & que not adjacent eden.”Sim) =y Oy) 0 & div =g AM) a divg)=0 Fs) g dilva)-@ Aly). 9 dtns)-& — dTlayre 2 b) dtlag)=Q olny) dtlvz)=2 dla) = a lms)= 2 Alig): 2 F*Vq)= 2 dw, )-2 dilay)= 2 dla k2 Gompl_graph . Sn whitch there is on ed A simple grerh 2} order >a re cated a compu qraph between every pary ver tee: Ss er full qnaph- t A comphtr graph with men "IAA ® catud Kkunatousks's five graph vertices if dnoted by IKm A wmpl graph Ks % qrap Biparht Gsxaph t Suppose a simp grap aunion of two a) its mutually a such that each edyin Joins @ verter then & ig called a bipat h br ts guch that ts svertex ab vis igjoint Aubsed 2} Mg Nq whtch we fn vy and a verter IND qraph. it & is the edge aed of Me graph, the gaph is dlenolick bY Ge Coy iV7.€) Or= (Mg) V8) The prio v, ore cat biparhit of thta a 8 R @ s which the verlex set 'S (onsider a above geaph Gr AB, CRO, SY and edge set & - AP, na, ne, BP,5,6% ‘The set v Ps unfon a) two o} its subset oy = 48,865 g Ny = J 2,6,2:84 pohtch ate such that 12) %q and V2 Ge afs obut 2) Every edge in br yoins aver 3)G tonlains mo edge that joins ___ which are in %q No This gsaph is a bipatte WE[Poe,sy o> Compu Biportt Graph! A bipartite raph Gr[ MM) is cal a tompute bipartite qyaph tf there is an cage befween every vert - in 4 and every wverter INVa2> Acompuh bipacht graph orl Vg i¥y €4 biparh es vq and vg contain y. and $ verhees wrespecvely with 2S ts dint dy Kms In this Graph each o| a1 vertices in 4 ts joint eath O| ¢ vertices IN Vp thus bys has yrs verhees ie sus ealgin 1@ Kgs 16 0) order gig and sim "5 » elt fs | O(&+S, 219) gpaph ex in Vg and a verter inks two vertices both o) qr with M=( A, By and” rHile in which | . 8 als | noe al, i a Ae a . ie anc Ny ome i Q Yea 7 4 V9 T A’ x yy mayA Se wine ged P:Gi2Y ¢ R oo kurotows b's Accomd guaph : The qraph s,3 fs calud i h i] Psaw the diagrem of ‘The graph wt wey ina eae * of the following piace a) V= $A, 8,6, 04 &-] AB, AC, AD, CD} ave [4 151%, Vq ish ee] 4V4%q)V4%3 1%%5/ a 2) V={9,9,25,7) End PS, 02,05} £2] Ve Jovy py, VyiVg 1% M0} Ex] VyMq Var Va%r 5%, a ¢ va} pas i Drake >s 6 ° e | a on PS { 2) Dee 4, t Ns | he ({ | | 5 Vs . e { v i> | s Eee ! R u) Va a N, t a f | a Ns MGht P,8,2,5,T sepresent cricket teams: Suppose thot the teams F 8, have playsol ont gamk ntth each other and the teams p,$,T have played ome gare with other» Represent thig situation tm a qvaph . Hence difuminu (the teams that have n+ played with each other (Th numbey of gomer played by each team: Set! ; p : & s : q NY 8 E . djwe observe +hat +there te mo edge between Gands Band T, Band S, Band T- Therefore thr teams Qands Bana T,Rands 2 PordT have met played with tach other Slfien the graph wenot -fhat a edgu fneictint on each o) Hy vertices. O,2,5,7 and g4edgu intihaat en 0. thus the teams 8,2,5,7 Aave playcd two garu each and eam P has plaid 4 gamu- i: Qwhtch of the fottousing fs 0 complit. —gnaph. A ! J Na Vy Na (a) (te) So)! aythts Ts mot eomplb qyaph “there is mo ete hetween fA and ¢- by thts te 0 Compl qtaph There 1s an edge ke beween evuy pair of verttees.All} Ge GtMe) is a simple year. then pswve that ele ivt-Ivl Sol‘ Each ects of a gnaph % determinud by o frase | ver Heel: Iu a sinaplu graph here oceuy Mo mutt pli edge and also the number of edgta cannot exceed Hu number Of Pairs o| vertices. the number 0} pane 3 wertces that can be chosen from Mm everticed fe Me = ME = u(u-ayin-2)! em-2982! (mee ax4 Soe ptn-4) “Tus for a simpli. qraph with M22 verkede , thy number 4 edgth cannot exceed Bon-2)- . : According ly Hf asimpl giarh Giebilme has m verttes arel m edu shen me glo) ot Ime nn be Quer siat vl ‘ Fite a : ‘ nee eee 8 {Show that a wmpWi snamelly Kn OA Sol! Ion @tompic quaph there exit exact ly pais of verti ces: Ths mum ber o| edgar Ps equat atp4ht number 2 pairs graph wtih oe verteces gntn-a) on edi between every ima compu qaph oJ verttecs: Hi the number of vertices is y-then onumber o| pas of vertices 18 Me) = nln-a)ln 23! 1 le
4n ! ™ a¢3an +7 n23¢ a ner 210. oo the lagurt possible valuto) Int Ps, Vex Ss hyper cube x 7 3] Psove that kedimmenstonal «8k a, Kak. Betermint 4hinumber of eg in On: Sal dh number ° vertice inthe hyper cube Sx each verex Ps of He cleqree K- Co the mumb sumo} dugyees 0) Be fs k-2* By the bedasoting property K9*. Qte\ where igi ts the sins of Q, thus I@l=4. wor o 2 kee” Fg 2° and 1 vend This means that Qe hav: Ke? : ts QxP? .ab24¢ — 3 number of eagu ir OeGja)What fs the dimension 8) nuper tube with Sauase edge How many, qvérhtes Que there im a hyper cube with &S50I eq $3 4 arly By has sawres edgy we have = &2” = Spugee Ne check that sausage: Accorctingy 2" “Lsauget holds FY be dC thus thy dimension of tk hypercube with cauace eagu is beat BNe check thos qaeotags sand? puhich Indicalr -thad & hag ¢480%R6 edges when k= 14 thy number 6) vertices Inahis byperube 1¢ a%= = Saaes : Feo alDetetminu Ake ordev 171 of tk. qraph tr=(Mie) inn the Following eases: . > A)biisa cube yah wih Gedgu- Norig sequiae with as ety A 3)G ha, 40 edges with Svertisee ay ORE 5 all other mertices of Hareend a ‘vA | sa: ante ADSuppose the order of tse“ - Since Wa ié acubre graph | outhe verter ©] tr har diqnee 3- Ana therefore “ts.cum q) Hh dugvees 0) vertices 1630 whos pd Since tw has A edgu eveishquld have gngome Ite 49% thy th hana tha teing. pooperty). a, Gna ae hus te order of tris b. BSince is vrequlay, all vertices of Ct mut be of the ame ,cuayge &§ ram k, Hy tis 2 order rm shen hy gum of the deqveet of, vertic en Po ‘kaa Since have 48 tga, v should haye kn? 2msox45- 3d So thot P32. ince has UB be positive integus it follows that rn mu be qdevecoi ° go: Thur th posible ‘orders y tw t tt | Gore — 4,2,35,6/10,15,30 Be oe Suppose the wvder of ln 's m. Stace tue werticer,ef tore digree 4 and all other are of ctgreed 2 Tha gum fdugrees of verttCor o} toy is AKUT(N6 2)KB. ~ < Since tr has 40 edger nteshould have (oxy +(m-2)¥.3)=d0 ioe tu Bt 3n-b> vo a7 : 3Bn= 20-2 9?” Bn=48 NV nb “Thus oader 0} tis vip RJa)lya graph wth ‘ny? vertex and‘miecign rs k requ las, ther — show that mr Be NDves Here exist eebie graph with 17 vertice ORbes there exicta 4.26 OMS ect C2) 140eagu Sol! a) 1} gaph Gic k wequiar -then degree of every verter Bek. go H thas M vertices , then the sum of degrees of Vevtices Poo mks _ By the fonashaking propery this eum mut be equal te, ht he medgu. thus nk =2m m= 20 2 quias giaph with b)Y there is atubie qiaph with p24 vertices. Th: number of edgar Ff choulet have fs 2m=3n am:3K1t ~ m: 23. i This ts Mot possible because 33 4g mot a. toholl number - thus te raph of drives supe cote aod exict: C)a) there 1s a & deqular gv aph with med cage then the number J vertiter njil Should have is given by 4n-2m 4r axis UN= 30 01 N= 30/4,ie Is ws poaay pee Buy, 1S aod awhoU (4. joU NUMber us the Gaph of cumtet type does rot exit « i DY there is v4 regular avaph with m=40 edgar Hun number og vertices H chpylad have is qiven by An=2m fr “ Qn=2x40 . : nes — This is poesiblr thug such & gaaph does a Gut ti be o graph 2} onder A such that eath ver has deqree £07 &. psove that atleast Cverteer have ougree bey aiteat 6 have cdeqte® s: : felt | bust P beth number a} verte exist {en ee) whch has diqrees” Then re oumbe! o) vertices 0) br which ‘hon lagree 6 1 qza-p Chere OPS. 02qea). he Hind that Hu cum of ol greet S+P 4 Q-p)b = SP + 5u-ep => S4-P° Since thig | -aum. had’ ta bevan © even number, P cannot be pdd. Thus ps 0,2,U,b0"8 ‘ fonsequert lg the jollowing possib Cages onise peo get ; pa2,G-% p24 QS P26 q=3 p2e'g-4 . | Ne abso observe that in all th above poss flo cages | either g ZS ov pat “this, means: that abtleart S vertices have dugied & ov atleast Gver tier have cugree 5” '” ~ 46] Show that Aheve is cab graph with 8 cgi, AA vertices “inthe folbiving cases ved | ATR. cuqreer eo] verter 18 either Sor of verted 4. tsb\ the ougree 9} verkk is either S016. Gol Supp there is graph with acedgu and 19 vertices which k verticer cue of dagiee 3 cach then alld atl 4| th yemaining 49-L verte have deqiee ¢ then we ahould hovel Bk) +Ul19-k)s ams 2408 * BEEAS-UE E SE ~k=@ K=-@ ushich ts mot possible BH at of Fhe remaining (49-t) verticen have cugree ¢, then we should have “ae 4 6ldo-K)a2mesl Bett2~ bab wae 46 ke ey, This ig aot — possible Hente in both of Ta Givens jth graph 'r) dui tupe cannot exict . ted aa] Uf k fs0dd , show that he number y verticer aa k sequit gaph ‘seven. ‘ “ Sol. ‘ Wak seguiar gap, Hu daqree of eath veviex ic k- Therefore f{ sucha guagh han n versreen than th wum of th degrees isnk and “thisha e be even number by Ha hand shakng property. Wy kic edb. this te possibl only ym ic even. 1da) Show thal toy @ tomplub pho) _m verticer namely kn with agrees) each verter 4g ned ond thal th —tolal mum bey °) €AQa IS 4 nena) Pak e L 3s BY. En haw a edgy, show that nlnedl= 2intm),Sol? ; ; a) wmput guaph ig Simpl graph in which every verter joined with every ofhey verter 09 exatlly oni edgi 19% if there ave nm vertilts each Vertex ig ypined +o Cn-4) vertice though. exactly one £994. Thur here octuy (n-aletger atevery verter The nuans thar the dagree of every verter igtne4- + 8B Bx oe ¢ Consequently te aum ef dug vers. > vertices (6 nin-4) ay hand shaking property, this sum must be equal ty 2m where mis th number 9] Ay Thu nin=4)> 2m . ome 4d ntn-4) thus ky han £atn-a) edge BIIf kn haem cages Han we have m= Lntn-2) The gives min=nt4 nlir-1) 2 2 rman) = Wn yen: 2imin) ~ atm 44) a2) tg there a simple giaph with 44 2,3 ,3u)ht an th dug vee of 4s vertices el. : Assume thot there is cuch agarh -Cinte thy ” oluqreet Of verte: ave = gin number, the graph should have & vertices say PBRS,TU,V,W anangad int — ordey 4 Cugree anew: Bare Then Since there are @ vette: “ant vere w fe a) olqnee 41 ahowld havean edX to at other vertices lu poxticuls womust havean edge to boty th vertite p ana & whreh ave of chiqree 1 Then Pr are not joined | to any other verter: and in postion tp vertex Vv whreb cg a} dagrer bs Cinee qvaph _Fs_elmpley there cannot be an 09x foining Vv to itselfBo Viean be point only to S* verter UyP)S 1/0, ther we cannot have degree 6 ‘Thig *$ A conhadicion- Hence there ig ord imple qrarh fy poheh He chat of Veytiter cue ar qiver Au] Show “hat Ahere exicts m0 Simple gion corresporciog to ate tee oe argues € BALI SA 5 4,4)23 8 DAWU He © : vere! L920, 4 ° . aya graph with nm vertico and nr edge of $1 aie minimum and ig the maximum of the aegreec Nee Show Mat, Ceameh =)! * — KE aida)... ,dn be athe cleqrees = vert Han by handshaling pope we have ane Oy ¥dgt-- tds 2m Sta) Sime §=minimuml 44d2dn We haves foe dors, A260 Ape, or> APE i staic _— Rading there an Inequalities we gd : f Agra Ibn 20h =@ Maiev Similarly d'¢¢, Ae mavirum (ay Ata ++ dn we’ gt dy tn dy -- 4a NOC3) 5 fom BOL we , MZ ard BEM iis, t ot. “ee Sp had ngeane nda wie + MZ ake iit onterm az20 4 rh 47% ‘Isomew phism} eae 1 Cons dlev 2 gpaphs G=(%e) and bt = (V1) Suppose there exist “a function 42 Vv! auch Mat DF fs a Bnets one correspondance and 4 For atl cverices 9,8 of, {88} aby arn eden ft {aun HW} Te on edge BL Uthen 4 fe an cated on tomovphism betweem Gand G! ana we Aa that Gand t' ose fsamor phe graph. Fanction: ; ; hk A and @ be gd mon-empty Acts thin & function’ 4:R>B tea Stelation from A 1B auth that gov each a inf there Is an unique boa B ~sush thes Gibyef-. Ther we wrié befla). Here > callie k eT a eae 0 pe image of J function f “from APB ts dink by F458 and plebsially gie prerented an ‘Types 2) function! Onto Function,’ i : lac : 4 1p9B ig set -fo be a onto function if , oe ee po] B sthene ts an element a yw yy eve euch hal” #ta)> pHi Me {unction- callid a Ausjective 4” ee; 15 | 4“ 8 BPrEBau fo Owe Function A Function 4iA38 fg gaid + be one fo one tunchon Afferent clement o} A has diffevert elemunt tm & under fH ts also catld ou fjective. function. A B 6 A Junction uahich rs both. onedv one and oe To calif & Ort~to On worvespomalente OF bijective function. Y $A2B fo sucha functor y Adon a unigu image fn 8. an fn & shan a unique fetmage ian A ee then every ebmint 4 A every elemerk . S== Fromme: “somorp his m! J Abo Ji othes words trond ae said fo be Psomorphic , correspondance be tween Y they have one to one 9 vatican és thee edgu such that sth, adjacenty ' paecerved- . ' Not! . ang thak the adjacenty of vaticen of fs preserved! me fox ony Pwo verti an Viin Walt —~ wy fe adjacent in uy then “Hu orresponding —vaticer uv aie also adjacent im u when trond oi ae 1gommov phic £x! Cons ider the 2 gpaphs tw , ’ we wat GE }Consider thr — following oan to 0 NM corres re! these vertices aie a paps - a Ac>P Bre, (498 , 04> Under this conespomdanee the edgur in there 2qpaph tworresponds with each pth ar follows: nae Lay Locke laey, tae (ees, {moherlns) , Le oles fos}, {¢0}2>4 0,59 above Pndicalid On-to -ont between th vurhees oy edqu oj the 2 en th adjaceny of othe vinticn psoves that +0 We ind that Correspon tan ce gaps paresery The exisiorre gy Gpapks axe igdmorphre these conespon kn ce Mon cider the 2 graph AL We obseave that both of thece glaphs have same “no. 9] * Vericer but cfifferer! mo of eager wthereloré, although here can exich ont—to ont torrespondlance btw the vestitet putcthere cannot be Dm-to-ont torres pon- dance hétween hk edgu: sphere fore, He Giver 2 qaphs que mot rgomorp hie: Not.” if t00 gaphs (i some np of sventices (a) som a0. 0 edgy: @an equal mumber of entices with a qiven dgee» ‘Two qaphs of TM same ordu anol dame sine anual mot be Feomorphic’ longider the a geanh « Ze ale #comorphre then they must haveWe nott that both g) thece Gi@PS of order 4. and gira vovyedt bul the 2 giaphs ae mot teomorphres We observe that there are 2 pendont venti ces in they 6 pendant vertices 19 the first geoph wherear there are aU etoud osaph. Aa Authy under .any ont to ont comes ponalance bts , the eager and -verhic& a} 2 guapht th. adjarency of He? tag wetiraue mot precer sied leomorphism of _ciguophs: 2 cLignaphs Dy and Qq Ose sax Fo be feomorphre Yo theye fe ontatorane — terres pondane btus “heir Vechee, and auch that adjacently of vestcer along with kryectons Fe preserved. : 4. Prove that 2 Yaphs shown below ale,fsomonphy 4 oe i = ' Ly bt | : Wy Uy Va vu Fivet we observe that beth —quaphs hove vertices. and aecger- Consider the follousing OM =tp- oraz torvespon- donce between ~Hha vertices of tls graph UZ Ugerang — UseVn Upc 2M This evespondance gives. the oliowing teh covvaspondar Ce bh he eatgei Quy 42 hers [yeh {ug jus) 2 {Ya Va, : {uj ua}e 3 {vor {4 ujer { Vu3) These stepresent pne-fo-ont eores pondance bres the edge Of 2 gap under whch de adjacent verticer in ; vertices ta sth isch qraph cowespont FF aagjacert the seand graph and vice-versaAlia ( wv nay she a graphs ale. Igomorphic a] Veoti}y Ahk “hs sthe 2 qaphs giver hetow axe tomorpher +P o e ° © 4 < Gol: Lib w wncider the one-to~ vertices q] 9 Giaphy under ®s,e,$ 4 she first graph tones p on correspondance bw ths which Ba vertrees A/8,6,0, oe atalclol, fetes! respectively a) aK ac cond yaph and ice versa ta tes €or espon Fane the eclgea aebuminud by “the ton espendiong, Nerhces corvespend de phat adjacenuy ol wernces sieiaad, Ar auch The wt graphs aie feomerph"e B\ Show thal athe ouewneng A qeay ae Reomosip kee eR gy a Ve A us My, a ha Os &, on Wg os Soh Congider tH — follows an OnL- fo OAL pho the vertices of tw giaph: Uy e >My es Wy Use VS" Uy c—> Va Ure aa i ew Ve th Se qives follovsrag torvespondance btw t Jes bya fusy per [%9 Me ones ponctanceJusyyer {ona {oymyy 2s Yaga yrs {ugubes {94% {Us Us} es fg yoy) tu Ug YPM Q4 . ; Vumdes fou. 3 a Lay ayes fry 54 We nok that both the guaphs dhave 6 vertices each of deqiee 3 and 4% etgu. We observe +that ti above Unespondante btw the edgar and vertices ase ont-to~One conespoucionce and cue porecerve
f ake two geaphie °S 3 yequias Cubic) and han 40 vatrcer lone ider the om to ont towecpendance bre th valite as shown below: mye dev 129123 +40 he check hat th above nuntione conespend ence eielots onde on- tovvecpendence btw tha edgu in the dew 0! Gaps sith ahs pewoperty that adjacent vevH ese in the fret gua pt Wwriespends +o 4h. adjacent vatreer in sth, setord gaanh and cevice ~versa. The two gears ax therefore igomorphie-how tat, th follwing qiaphs ase mod tcomor pee | a x Gd: c © s e Sel: ; We ebiave that the Aine Go ph har a vertices and bedge and a avaph has U vertreer and: Lecgu therefore OM te ont toWespondance bho He edger 6 tot fouibl: Hence 9 quarks cue not rgomorpe @]Show that folowing Géaphs ate nol (comorphre Sol! we not ~that cach of Hu 9 qraphe nave bvekrces and Yedga- But the firvct graph har vech'ee of aeqree 2. and 2 gtaph har Bveitkees of diqree 2. there fore theyecannol be any ont-4o- ent con espondance bts Hu eoger and vate wohich preserver whe adjacency o] vertices Ns Buch athe +o qraphy atenet TSomo phi ¢ AShou that Fhe ‘following graph ae Pet rsomerphic So)! we mt hod 4H fins graph har 4 pair of verticer 8 Giger g which ase moi adjacent: wherear Ii 24 Goph han peur of verticer of dugnee 4 whch ane aaf- acent Therefore He 2 quapls ate moi Peomorphit- J Show +thad the fuse ph mad enet be teomerphre even} they have 4h” sam aa. v vert eer and edge € 1th i asin gus MD el vesticer and edger with cameSO: yb oo BO 2 Me | J oT v Q " fo. Ma Sol We obsewe that — loth yaphs have samt mo. ot vedi ces b and same nv vo} ed 5. 1 In each ef them “there cue Bvehiero! degree 1, — Na rVye Me inthe fingt geaph and A,P,R tm Ae seasaud ph, there are Qvateer f deqree % namely Vaoivs tah fret graph and 68 tat Second ’araph, and theve rs ne verter a} digiee mvamely Ve in desi graphand ¢ in 2° graph. i “Thay athe 2 equal snumber of versiees Rut g ganhs ae cist téomorphre Because -theve axe thi ch 38 : QR pendant vertteer adyatent to vertex Van of digree 2 in he first qaph but here i¢ only on pendant vertey Gdfatent+4o veuter - ca dagree 3 int deeoned geaph- As suth, Ha. adjaveney of th, verte Cannet be : preserved under om-to on conecpondane bho the vertices of the grenh . T show rat Hu Apltowi diqay (gomer pve ‘ey ¢ ad le Ge Coa. 4 fe P Sol’ Taian following OM to ons Lgrvespondance bho _ the vertrees of the a7ven yaph f Ace [ Bets ar Cle ream D4A2QUnder thts (onecpondance tht dinected gear» eorvespomet with rach {®Bheol °, $3 {eiches{sieg {co4eoh eal Lp, ayer honry Under thre teres pondance +Ru adyaten of tle rtertcey - tuclucing Ha drrection of hes ectgen vs“ pyerersed: 2 Hente +a Gaver diqaa phs isomon Pc: PAgU of hire ether an shown Lelia Ab] Show that following digiap cue nod (sumorpk'¢ fh & Pp . ss .. Sol she two apks have aqm mumber of vatite (sand +h. cami numbu 0} divected eagu 4). We observe that 4h vulex Aol th first dugqdaph han Am and 2e6 its inauqree There ry mo such verter in & ph-therefore there gannet be any ome ow between “Hy vedic of” mts Ho dagen’ ahr preserve athe director 0} edger th Igomoy phe: rh out degre? 20% g7d Corepondante which i Aree duquaps cue netSabbraphs | Given 2 graphs brand by jue soy that big fg a sub Gaph o} b 4 she following tondtien hold a) AN-tRe vertices and edg of G7 ce im be a) Each edly ol by har fh: same end vertices fr Cy on om Lg Bo ey * C Ne Me G ‘Mu on Ne Soni bpp biven a graph i-|Vie7 yf thee 1s a Aubgeaph Gaz vg 6} 8) such hak mys ev then Gy 1s cathe! spanning subgeaph of by ae a. &q: S ‘lag : ho GT | ° b 0 | = G bag Gq” : (g nig subgraph)” | Ineduceet Subgiaph' a “Given qaph t=, vit} auppose there ig a eubgeaph Ga Lvyihsy of tr “such that every edge LABS °f by. where AREY an oop oy Oe aloe Then. &4 'S catud an imadutet aubgaph y band tg cane Gk by <>Eage Gisjoivk and verter aicjornt subgeaph _ Kak G be a guaph ard Gab, be 2 Aubq 19 phe of G then qt: VNbyaGbry ae sor tobe cage disjoint +] they 38 Mot have any eatgx t1 common+ aVog& &, are card to be verter aieyoint 4y they do not have any tommon edgeand an Y tommen NevFices + ; fe i ee P Rai, & Swat AZ g & . . —___+__. e s 7 by & bg and by due edge disjoint subgyaph- . 3 and ty, we verier digjorat aubguaph : aph tq can there exiled & graph Ge cut a Gubqraph b} be bud an a eee | subgiaph el tig and yt Gy ond Gp Sams sin A N Ny Ny Ny NB oy o, Gol! Yes. (onsider a aph by which tontarng atl te top exten vertices and, edger 0) Gp and atleat © Foolafid vertex: 3 lonsider O york chouom below. Ney that ay 2. ath qraph &1 shown beloew, is ~ Men pd antec sub gsaek Bf br. ls this a Na etpdnning AUbataph o} br.ve N. K& > Ng Na Na b) Dotaw the cub gaph Gry nduted by th se Va -{¥ 5,04 1% 6) Vg inal Aonsider a gia ph & Shown below Ve % ¥ Ns Ve (ty: WO. ff “C] I Neg Me Gq ave Veiyy that graph Gg and Go ahoia beve cue imcucea Sub yank and traph Ox #8 mot an Induce subgraph eb. a)For te yah cghoun betow find Meaty. dsj ornt star ond” ee argjoimt ~sulogaphs a a“ e+ > i Qpestion om Graph! Gnsider tise quaphe taanLoy, 2.4 a bgek wees hen he Yaph whse verter Stk 16 vq U9) and the ecigz sett ts GB, VE, TS CAME Union o) yard By And Ht tg ctinelict by WVby * hur. Gad, = (agU%', £40) 2) Similoly iJ VOVaF DB , the geaph whose verter cet 's VaNY2 andthe edge et ts Eyhe, rg Calle We intersechono) Gaand big and 1s cenotia by fg Mhy- thin boy 1 by = Coy, “4A NV, 2a €,) YF Va Ny #9 Suppose we concidu fu aph — whose NA UVy and eatge Sek rs Gy AG, Jet aymme tie di Herence Vevfec sek ts &, AS, Hy And 25 this geaph Ts comed th sing Aum Coy? a and Paxane it where| Merten cleteted aubgraph: is : is denoted by by Als Thus rq OG ~(CA0Y5), £4 4C,) 40V2), Eq AC, S48, =Ce,ue,) Ce, Ney) na N2 7 Bw Ay Ve by
verten tn geaph ir then Gav: knots th subgraph of br oblaruct by dling v and all edgu imticnt en WV from &. ths sub yaph wv is wat an Vertex dbteot subgiaph of br- oo Eage itil subgraph’ WY @ 1s an edge in qraph uy then br-e cnt th Aubgraph of Gr oblained by citing e fom tn sis subqaph &m-e is fee eg Able -subgiaph of br. es 4 2 G baw ie,Compliment o| @ Aubauaph! Given a Graph Wand -subgaph big of The subgeaph O| a Obfained by debate ally edgy ‘hom by ; thal belong tba Is"¢akuel tompument gy 4 ah Y Te ctatiol by tie Gy on ba ov ha tay be the subyaph o) & ahown by th thick Gaunt HLabove Garhe Ths tomplment gq) bg ia b is shown in the Mod Jgue- fompliment 9) 4 simp graph ig We know us every dimple giaph of order 01% he “Bubgiaphy] Fi temple “a¥aph Kn =H Gris te aa Qi0ph o| erder a Han the compliment 6) bien < ise temptiment of simpli. gsrh U ard is dinkd by G AA ko mnt ‘ fe ti be a Aimpk quaph o} cider am. St the she pj ti fs Sb and sim 9) & is 80 ther whak & 7. Ne have yi o) GaSb SIX. 0) br 80 Ne knbw that & nob Po LIK of a= gine Of He ATHL 2) g0- glnl-49) -56 M=n 2 go4st = nt n= Ve talyeQ) Open watk Open but vot a tart UELAWIE TM LEY. v9 12 Cr Torial wshich not a path becaure vater Vq ‘9 Yepealed. |G) Trial which i¢ ath | (5) Ulosed vole Pea a Nira (8) tgsed GALE which te a crust but not 9 ty ch \ ls Fi YJ Fina att patty thom verter A ao vetler @ and alto indicate greta length + AegBeak sgh = 2 A C4 f Ting Be BGR mnath=3 2% eS Ren Rese *nath= 3 pasate * fiepPes Qesb% Bling th=¢ Find att the tydn present inte raph shown below e 8 ¢ (BO, ? Co8€aB e 24 |e, Z «Beg BLOPS AY, “Rapiees fl © Be, PesBed ' ee 8 ® pes Bea See? = Pe, sea bes | dl Fes the graph chown below find th natne of thr following walt - 9 6 ‘6 < o 8 a watk whch whreh VS a hale Ca) BA PLB acuse ig a cireest erpaba —oper wal (2968 APEG STWIO. which 16 aot a path b Q woe : ecaure veter g] For +h graph shown below Jind she natut of Hy following pwatlue 8 é cr AGEF OAC S th cz) AREF DC A F \ cada coreRom t ¢ Fad Grich Raed WABODFE BD! is Toate whieh ig aveieait. 2 R open walle Toelosed watk whith ic geyds a6) fo te gtaph shown below Voity that Na 2 [> Ns Nes WAV VsVu Ne ts a ty obs o GUI Va Vs VaNaWs ts a claturt whch is not a. ey ol - @raaVyVa is a nrangl we tyel formed by Sedger te caluet a range - Wer kK graph shown below alliirnina aq walk tom No to Vy whieh te mbt atlar Ov, te Ve is asl which fe not apa. (a pe dom Nfl4o-Vas 9 ooo i Bo tlssed wath 4rom. Ny fo Va, vahith i¢ mot tirerrt. 14a cacut trom \, Vos which +0 a uyele fom Vato V. ce 2 ime ‘s MoS HT “ae. 4 pathy hat ‘eve 7 ay sc i 2 : « Me th; No H is a a tyels berawe Gf it han to be a tycl, than +h ermine, vader han +o Vy. (2] Hes Vy My Vg NYU Hs a wacuit, becaune no cagid fs nepead but Wis nol a pate because Netten Ve is srepealid BiMes i Is a hiangle- betalve -thoedngth—| gue 3 cdg, ; ML eat cy ; é > af RAS| Teg Ve e4yy Cg°V4 €g Vy ey, a 2, €3N3eyV arr : if ole J Na fa Wha Mo eg Vel Vseyy, | BU Voe3Nges%a AY Vy CuV sea Ve C14 68 Vs eg Np Te eq Ys Qu er Vgea% 5] Vy ee IS PVE €q Vy & de. Nt@ V5 &%Vq er Vae3Vy J Determint ; the ok arp} erent paths o| tength 2 Nyy vs vq Sel: The no- 9) paris a length 2 “that pass throug h vatex is +h no. of eclg jatidund on v4. Since 3B edge va tmticund on V4 > thig no. f 35-3 _. withe m- of paths of Qngth 2 thes pan Huo ugh vatex - esp* 7s : Be irey Bey NewvgiVuiYs vy Be Be, My th 2 in sothe delat Mo: of pathe gf tng te Brbe3414343e449- +h giver yarh GJ Puove she Aollowing ‘ ¥ poe th with ave Sasa hay nvurice fe han 9 ed a Cony aan’ of evoy Veron im Ady tg a: So)" t-te tovt vaker is an ve oH a pot \ma oth every veer a veugely Om eatga The aA (me nk must Pave nod edge Thy as Lntths oba] otysls every veer F¢ Jollowed } by preusel edge therefore if cues har Le ae niga y uw vertices hen 1 rout ba atyth oxaclly 2 ego jimuclimt on every vatex a a though which we enter tk vaten anol ene pre eaga fhiouyh wlth we leave th veden ) «Theres th degree af every vader Im Quyth 16 O° 2 Congider a graph bof order =2 , Joo vertzes tu ty cue aad Jb be connectid 4 there fs atieart one path “hom one verlen to other - poe aay that a giaph & fe wnnetla graph tf eve pas of cictinel verticer in @ are conneclik otherwise bie a dictonnretet geaph: : In other words th graph b 1 aad fo be Grernscd HY thee te aiteort ont path blew every Aeehad avectice, im & and serie fq) Digwonneted i] b han akleant orm pasa ° ais track Votre betweer which there ig mo path- + ; En! NI Ay YW a al Ar Ny \ Nig. woo Me, “at Cus usneit and Susu ail» Lencidel A — tonnerid- graph Yahere 16 0 Gault in & that contains (then that uaa ts callud an tf thee isa heal In & cthat comarng, out ths ealges 3) © then Hat hail rs calidad an Sule Hail. ‘ A comedid — guaph Has containg an Euler cust ts calyd an eule gah A connecteel graph that tontalm on Eulu bail recone eae) Sulu . qaph & a put th: ‘edgin 9 euler ere d Q R&T é
You might also like
Unit 2 - Graph Theory
PDF
No ratings yet
Unit 2 - Graph Theory
18 pages
BCS405A Module 5
PDF
No ratings yet
BCS405A Module 5
87 pages
RGG-Graph Theory-Unit-I & II
PDF
No ratings yet
RGG-Graph Theory-Unit-I & II
70 pages
Graph
PDF
No ratings yet
Graph
9 pages
RVS M1
PDF
No ratings yet
RVS M1
62 pages
Graph Theory Notes
PDF
No ratings yet
Graph Theory Notes
27 pages
Unit 5 Maths
PDF
No ratings yet
Unit 5 Maths
27 pages
Graph Theory handwritten notes
PDF
100% (1)
Graph Theory handwritten notes
15 pages
Rosen Discrete Mathematics Assignment - Graph
PDF
No ratings yet
Rosen Discrete Mathematics Assignment - Graph
5 pages
Unit 3
PDF
No ratings yet
Unit 3
26 pages
discrete structure unit 4 Shivani ☠️
PDF
No ratings yet
discrete structure unit 4 Shivani ☠️
26 pages
GRAPH THEORY
PDF
No ratings yet
GRAPH THEORY
10 pages
Surakshitha S 180835
PDF
No ratings yet
Surakshitha S 180835
6 pages
Graph Notes 9.04.2024
PDF
No ratings yet
Graph Notes 9.04.2024
8 pages
MFCS UNIT 5
PDF
No ratings yet
MFCS UNIT 5
82 pages
IIT Madras Data Science Diploma MATHS-1 Week 9-12
PDF
No ratings yet
IIT Madras Data Science Diploma MATHS-1 Week 9-12
59 pages
Chapter 5
PDF
No ratings yet
Chapter 5
51 pages
Adobe Scan 17-Jan-2024
PDF
No ratings yet
Adobe Scan 17-Jan-2024
12 pages
DM Graph Theory
PDF
No ratings yet
DM Graph Theory
17 pages
Graph Theory Basic Concepts
PDF
No ratings yet
Graph Theory Basic Concepts
15 pages
discre
PDF
No ratings yet
discre
75 pages
DM UNIT-III
PDF
No ratings yet
DM UNIT-III
36 pages
DMGT
PDF
No ratings yet
DMGT
9 pages
Graph Theory - 1
PDF
No ratings yet
Graph Theory - 1
8 pages
maths pdf
PDF
No ratings yet
maths pdf
8 pages
Graphs
PDF
No ratings yet
Graphs
41 pages
Graph theory by nisha godani
PDF
No ratings yet
Graph theory by nisha godani
54 pages
Adobe Scan 30 Oct 2023
PDF
No ratings yet
Adobe Scan 30 Oct 2023
51 pages
Mod 2 GT
PDF
No ratings yet
Mod 2 GT
11 pages
UNIT III - GRAPHS
PDF
No ratings yet
UNIT III - GRAPHS
19 pages
Unit3
PDF
No ratings yet
Unit3
56 pages
DSTL Unit 5
PDF
No ratings yet
DSTL Unit 5
25 pages
Unit 2 MFCS
PDF
No ratings yet
Unit 2 MFCS
26 pages
Unit 3 DS
PDF
No ratings yet
Unit 3 DS
23 pages
Graph Thoery
PDF
No ratings yet
Graph Thoery
8 pages
DSTL Unit-5
PDF
No ratings yet
DSTL Unit-5
24 pages
graph notes
PDF
No ratings yet
graph notes
11 pages
Graphs and Trees
PDF
No ratings yet
Graphs and Trees
21 pages
Graph Theory (Unit -5)
PDF
No ratings yet
Graph Theory (Unit -5)
51 pages
MFCS UNIT -5 GT
PDF
No ratings yet
MFCS UNIT -5 GT
50 pages
Unit 4
PDF
No ratings yet
Unit 4
20 pages
complete unit 3DM
PDF
No ratings yet
complete unit 3DM
24 pages
DOC-20241206-WA0036.
PDF
No ratings yet
DOC-20241206-WA0036.
20 pages
Graph theory-1
PDF
No ratings yet
Graph theory-1
53 pages
DSTL Unit 5
PDF
No ratings yet
DSTL Unit 5
24 pages
DM Unit - 5 (Part I)
PDF
No ratings yet
DM Unit - 5 (Part I)
29 pages
DS Unit IV Handwritten Notes
PDF
No ratings yet
DS Unit IV Handwritten Notes
90 pages
UNIT-3(DM)
PDF
No ratings yet
UNIT-3(DM)
11 pages
GRAPH THEORY Notes
PDF
No ratings yet
GRAPH THEORY Notes
36 pages
Unit 4
PDF
No ratings yet
Unit 4
13 pages
Graph Theory Gold
PDF
No ratings yet
Graph Theory Gold
50 pages
Unit-5 DS
PDF
No ratings yet
Unit-5 DS
31 pages
Aphs
PDF
No ratings yet
Aphs
40 pages
Mfcs Unit 5
PDF
No ratings yet
Mfcs Unit 5
20 pages
Week 8 DM
PDF
No ratings yet
Week 8 DM
10 pages
Unit 5 DSA
PDF
No ratings yet
Unit 5 DSA
13 pages
Unit 3 two marks -1
PDF
No ratings yet
Unit 3 two marks -1
9 pages
DM (Unit-3) - 1
PDF
No ratings yet
DM (Unit-3) - 1
34 pages
Unit-4 Graph Theory 1
PDF
No ratings yet
Unit-4 Graph Theory 1
12 pages