Scribd
Upload
15 views29 pages

MF L6 Graph

The document discusses techniques for determining if two graphs are isomorphic by comparing their vertices, edges, and degree sequences. It outlines the conditions necessary for isomorphism and provides examples of graphs to analyze. Additionally, it covers concepts related to Hamiltonian paths and trees, including criteria for connectivity and acyclicity.

Uploaded by

Bantai Rapper
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
15 views29 pages

MF L6 Graph

The document discusses techniques for determining if two graphs are isomorphic by comparing their vertices, edges, and degree sequences. It outlines the conditions necessary for isomorphism and provides examples of graphs to analyze. Additionally, it covers concepts related to Hamiltonian paths and trees, including criteria for connectivity and acyclicity.

Uploaded by

Bantai Rapper
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/ 29
UNIT- 6 GRAPH IHFORY 4 TREES “Given Ihe graph pictured below, apply the techniques [rox checking goaph js is omoaphism 4o deteam’ne ik i+ is isomoephic +o Gugpht by compaisin £ Gegph 2. Show your zeasoning ¥. paising edges, + degice sequences, dhe Neahices explain how these teps conclusion” Je0 lo cheek dhe givenTqaph ts tsomorphism or not we haye +6 cheek four condition Eo fer thys ~ ead to your a. Number of vertices (¥)an be be same in both gaaph 2. Number oF Eclges (E) are to be same jn both gaciph 3. Check the degree of sequence 4. Chee the Vertex (¥) # Badges Ce) t's ane to one corsponds for fh the both graph Ex. “The Follossing is the two _gaaphs - Graph CG1) ¢ Greph Caz) at , 2) ay 4 | rv Oey wv Le | <3 ot d v3 ae)” 45 @ 4g .4) Graph Cors) Fi g.2) Gren C42) 1 4as eet the eof 5 divi) = 2 ens fee dtr) 2 3 dtay oa atys) 2 Atay a _d(ys) 23 Alas) 22 {vs} + 2 dlas) = : “both Giephs Gt 442 ontains. same no ab dgne_ 4 Vestices, Cheele He One to One canespondance for fie Mertlcss 4 Edges ty both gaaphs: $4 pee Date 29/12.12£. One em | o. The Yestey of Gagph Gt {sone to-one eCaeal +e Grrqph G2 Vertices He Chee oO. re, dhe edges? Teese ype vg = Bla 0s), Casas sh mh ther a a ee Jee eee ne eee Caras) ash Ge | |S thine spa one to one corresponalance —_| | in the edlg- | ‘ “the Given +20 graphs (Gr 242) ay Wok satisfies gl the. Geonditions of I'scomephesim cthere fare it 13 not an tsqmorphit- areph @.2. | Consider the Polloasing” Graph Find a Hamilton path ! dan’ Yee path be erlarced to G_Mami lion cycle ? Xe DB = Oe x a——6 exo Ye é a of . X ae Peg. Graph as Homi lta nton path Byery Vertex af Graph — appears exacHy ance in 2 ath ls tknoopn 2s + hamiltonian. path Hamiltonian Grcett f Ath cuciréeh hich’ contain + very Verte F the evactty | One Ceyn, et die [i last verke) is known as hamitsnian cicajt A graph shich has: an Hamiltonian circuit that gzaph Ham anton Goeaph * 13_knewn as Pamiltontan raph | “lo Find te’ Rami! tonian. path Por the giten Gounh Git) we have to coves aU verter at jt Phok 5 an oe . ae : Hamiltonian Path be as’ For Graph Gi. that cover all vag Hans, §$F4aAD eT w45_5 6 —D 10 453 ag J). SD x S Q—2 9 B—ND X K ese Ota, Hawilanion Path For Gremb( Gt) } “Ikk___qhoye__Giraph (Gt) is not to be extended hamitenian cycle because jt pat completes th circuits © Ones Tf ins ar tno merpht, give oJ © Wi “Tf nod plain Q Gonph ti vs Lai b,c ded B= Xfarbh fare 4bid) Graph 4° @ | e—f 2) OX ‘ © Fig i Gran @® : =i ene | Aa th eek dodges ue: given Par Graphd We draa th Graph: Lda es oD fee me =H Fig! Graph @ “To cheek jpe gen deso Gaaph Gi tat on den we have to equal_or isoraphic or not cheek 4 condityony of Ye ~ isomerphicm aa ds Chee He “ nember af Vertices ob Graph -O an__equal or no! + . quiiee TA Graph © “Ther is 5 Nester h@® thy is 3 eck | Gon —— . “Pte pumiher ae “Neadey fs aot fay | Graphs G4 4 g2 Meorg | ae 2: Cheole He number of celget die equal do 4p bo H ; Cranks Gi dq) 3 is “th number of ‘gadget in’ Grash ad mS J Tk number of Eelqey tin “Te number of belges ax not equol Hen “the Gaunt Gi ¢ @h on alsa not fs omar phic Geqph G) Ys 6 in hath Graph Gt ¢ G2) nat equal ¢ Bal" Analyze dhe Following graphs, ¢ cekrmine hich ox trees, Tupstif. Our Answers by erplaniny abe the ach araph i: Onneetecd, acyclic “f. satisfiey th zautred number of cclges fora free, Rr cach grayh_ poyjde detailed explanation of chy jtctoes or does net mect the criteria For being @ dre", Qe GEE) with V2 kar brendied € B= k¢ab} dae) db, toads <4 e}) be Ge GCM with s Labi cide} 4B 2 Xkarbh Chel fort? Geel) CGB) ith Vet arb ey dich Yevorbe died 4 Eo Check—it fs dre or polio © Conneo ted! QU yertices Gar connect, star shown in below fig © Daten Jaz Page HO) @ hepolic i Yes tee ax no cycles “Th graph doen | t fos an closed Loop. © Number of edges? For S vertices, q tree must hove S~12=4G edges, & ths -Gronh has Ceactty 4 edges 2 This i a dree beeause is connected aryl f has the cree} number of ectges. C+ Graph G2 CY)8) GV Labraaicl & Bs flab}, fac, tad) dared) here Srvedver 4°46 edges . > Cheel tt 3 thre arnat® DQ Cnneceted? Yer all Verties ar conncctey because verte a_ts dire Conneetel to all ather yertizer, gh ocd as fn belnes Prgee Oy On Ca we fig.® I Acyellc + +. ther Gre no cycles, Perch eclge onnceds directly, fam a to another York eofith out Flos ine a_loop choco in fig. © \ } = Nember of edge! Pars cies oa : - . ws haye: Gai 24g edges, % yey > dts -apeph ha. ‘oc Ht : - . 14: edges. Nelafije tise yee couse Jt fs) connected aeyclic, £ has dhe. coxsrcet . number gh eclgee ds Graph @ 2Cvie) Bolth v= Carb, odied.¢ Bo f{a,b3 fared td cdf Tew, tq ty Graph 5 Yertives + Bedger aw given > Cheebing if ity dice + U @ Con nected ! No, dhe graph js nat connected Chere aor texg dts 4enncele| pratt thon in below graph! ~ u A © 9 @ % Cig QD @ feyclic White tk gretph fs aeyelic this cloern matte the graph is nat connect. y 7 tree mus rof edger: For 5 verti a ~ = haye Sris4 cages byt this guaph has only 3 «tges- peceaeeeeenteee op. wthi's ts 4 sree + be. x Y us Se ee dee an doo fren edges G wees aa , 2 | at 4) ——— 2} Consicte x J ieeigia | : ayn ; Lingle ginph_, con) atc Pi nition of vender ie _simple guyph + degree thay —ciny Such _g | pep Csing sponta “ants ce me et mm aximu hy humber of af. edges Incident to 2 e_eyplain how ie sclades do Ihe dota! namby of Neatices on, : Simple _Goaph? A simpie grstpl 15 _atvpe oe Which each ge con Atels Yeattee. S, R there are no_Inaps op pau) bile -clg, bedacen Ip jam. ; pee of yerices if “cade hi Verto Negree tty. eyree of a etter IA a araph fs the number of Mayimurm | degre shan certo tn thie gah i 3 le Graph with Maximum Negree — ~ Th ve a each Nerkx to every other vertne complete graph 22 di )) = He - all yert2 es ha: iy [= Degree of a=3 a a Pe oe er Pe ~ Nearee of ct 3 Codgey 2 6-95 © [~ tegree at d2 3 (cedger odoc,d-a,d-#) —__] ane geanh IS dhe number sf sar —— Select 2 eations sut af 4 to solge “the given by the combin tion. — a (A whe tse / ——_1 4 C4 st). ig Si 2 Fudeen ices nh et Given too eapht, analyte dhe Stops tcauird to dektmine if they Oh isomormbhic Break loan the Piecess into lex carmnonents hoc | de you compare the nemher of NMeetices , edges PF neerdor teaeeed 2 =-1 Tp ~ . deo Graph. is Qs Polloag = Pig 3. Mg .2. G2 “Io de trmire dk given gtaphs Gite) ay jp amophic Qr_not ce hhenic to satis Pes 4 condstare. Js “Th number al verhicee he Hh sere_tn_both Grr NoYertites In Graph Gi > & No. Westies in Graph G2 > & 2. “Ube numb-r of Fdget be tp Ne of Beges in _Goaph ot og No. of Edges: in G{seaph Glog sarre in both Grupt 3) Chéele be dequre of Yeatryn. d(%)e 2 tla:) 2b d (ya)22 Achye 2 ‘ dC Bs) > 2 4casy2 2 4. ALD ak ane ane corespinds Por tHe eitices ff edges, hut thr 1B no heed ty check Hristo ets Conclitions hecenyse > He Gtraphs G4 442 Contains Sore no: of Vater with equal degre. dha k gaaph (5 called as Peqular Grynh ¢ All vege lor gaaph ar th fsomesxph gaeph. Follow ar l ed or nok Ils chrobeb as— Matix Pcprsent Pr G4 Patsin Pepreent Ar ae 4d 2 eg, : 4 4h ay oy 2 Ona so) alo t to Gh @). 1. 87.9 9 Gre | o.90 J Wali fe.0.8 Gall ooo 9 aoe Gedoesy tOn eo ae 22 Th giren doo graphs ae GI4GL gre ; fsomerphe a dhe all condiHars an satishes fae dh Jsamophim of th Ro graph a Ss —| “1 1 “Lo che brmin ¢ ohedkey ls Possible to et —|_sImp)e gxph eoiyn 4 vbitices 1 hoes _y Jed ly hacer ctown he IZOUOTID ergy * : DdcPina Han of ZIM phe geen Says thot tte aba ¢ Cannects foro Ish ineop wrettites Cro oops). F Pacey “Mente. | z nee Blow} 4 le tag £ th Pollo caing Bt Aig em m a he rpretentedion J. Fox th 4 vertinny + €e dager dhol “he cain Nees tr simp), grep. : 2) @y-—. Neath Ge warty of b wedges immpossible to done Ledges in 4 sertive in simple graph. Binet jastify | Danaher the graph —dn—ensuss shat she _degeee_ | i isFi at dhe geaph i os ices inf toda mbe fa oi opaphs Using this Sn foemertion edges 5 calewlate d= numbea af cages Pa your — alution, Addrraraly ee = | itons nods have o@ degre af? Handshaking | ernyno vertices hove cbegree 4 ¢ | 4 yatlees have clegrne 2 | Osu th deqrecs of all yotter). 2 ed0 4 ACs) east d e)tdCs D440) [ose SERRE, ween Glren in Ie exampl- Lae a ey ‘aating Jo Handshaking Lemme, abe sum oe the degrees of- gl) vertices 15 uize He number of edges, So, to find th number of cages wo divide fe dodal chegree sumhy 2! Beamber of ed gogo 2S mp | < Th thn an 8 eclger in +h graph oth 6 poder that f 2 PF them trodes hove 4clepte p ‘chnalbiss qu of 2 degree ta A 5A WADE 7 ty. Crsiph coil Enedes Does dhw exist. ag teanat | 241 nodes ? dare wih exactly — i 3 OH Bulesion pathy an Bulerian ofrcuih +— [@l0| Daas @ apaph Which contains but does+ contain “Tk Buletian path delineation ays, that be a ef Fulesian Nath! Byers edges of Graph Appears exact, nee tn the path js calkel as Eulerian Pash peta —cleclt che clecub ushich combine oyes ge P th getth ecactly Once Copceprd \8t4 last). Jevin Pat! heya ph hich has an Bederan Greip ay>——6) fe @) ~ I ee ee bu + not conan Buletian crea! det Cb) 24 duy22 da) =2 Adley 2 2 alee )> 2 | alCay> 2 ‘ ACh) 2k Y ai) 22 Je vertign th odd decane ane. O or 2 puzscnt ker culerisn path expt. PF Ip every verte in path [qeaph hovia even deqiee tren / chlenan Creu exit. : ae: 7 = 2 When oe cansider Sele: ting 3 applicantions fom > | loo im must ase ambina Han. Pemula Ne nt 3 \ cae \ loo lool \ 3°31 Cleo-3)! \ | loo x 33% Sener \ tos SAT seat = low x 33 X49 = 41;64,F00 possible cars must be passiby. sing dk given mean (s) & Yarianie (alt) of-a binomial distribution, colealate the probrbilit p tainj, 3 Apple the Parmalas Por mean obinomia) probality chielsibution in your riz ) alts ieibu \(® find OCr2=3) Meary = np Sanp | 4-Vawlance = 1 = Npqs Apqs- 39 oo a Ta ie Fenp xs. [Ref Ao = => le bows p+ dod Pe 15.9 Isr] fo | 40 snp 2S Lol nes s Fy 4o 20. 5 Sllag a1 aT = Te 45] | preeay= Sp q3 : 2 53143 3 fay) a U7 } ee: 46) Caen “ti Fears 0.469% 0.0f he B= 0 Lo Gaiyen that Asanclom yariahle ¥ is kK ® binom fall peobabi ty awe “ria! analyte die probabilidy fs to3bution + crleedlate dh Paltostna As tit buted baith 6) daigle 2S success OF 414 on cach | @ Dekamine dhe probality of evacdly 4 eguccesses + Apldin how you used Str binamia) chi “allukion. Premala do aeriyc at dk olution. ® Analtee dh probality of exactly A -xsceesies 5 a & seplgin “he yee tee lj —bino-mnie|. Atshributian Poinmlai de-areire eek Fhe Sal sharing at learhiane sucese Justiky yoog— A ppieach fn computing Hey_comp leer} af- no. ‘succes $24." ime | Given? Random voriabe. Eon binomra ly Az Irthu bed G trials . : > ne6 Cnamef teas ) a pet 0:25 Cproberblis etsuceess par p= f dyia 1) : — Bs) Pormula = Pt get A gad Perea : 4 A jay | ; aa uN (Deed M0 tsa | | a 3)F G79) ~ | pcre 4)e % Co2r5) =(6 sce. 0033) CoS) pe ta re = 13¥ — \ ae B4. ® At leas 4 - ane Moco: fiAd plyso) = pe Te pty=0) = Dian]. Novo find proba lite. fy» Pl x¥>s)) = l= PC 26): 2 10. 1 _e-p] “To Find tbe binomia eaviable oth Fay we need ty Cmumber of trials) tke _binamial Disa bution, GUCCE 5 “Tabet 9 PCrst) + PCYS2VE PCY DC =o) Whe, Ls distet bution: fs a_mcan letemine the Lc 'PCes LS PINT PCy PO gn-o db C%G J? Corre)°, Co.115,)4 ot lee ol edbich ma aandsm OF § | vailene, prababi lity. “fy Fed binomie/ ZIG! . G@! mean = 5 Limkan > fe np = “np25 Natlonces tht =/npg = 9/4 TES \ pena fvaices npqs 3fy [p= sao | ——— ORS OD Vatlane » Fy ns npg sD VailancL =” hp ‘Ws g = nb go 3 3 t 42g aS fo 40 Ptqed pe d-o 241~3/éo JP = 3/55 £3 aloae , of ale ft Cipio)> C3/40)F can x Co: 22si4 20 ¥ CO: 46)" dies lied \ Army Corps fn (sae, show GU) fen S | Govolved in He calculation t _ o. 2735] \— = Sé woos x Op We lnow , = Oxi. - y ee 5) 4D bre a pocds\ P(e» T) v 4~Cpcyra) # 062s) | : : ~ a d- Cosa 34¢ 0-27), ‘ ‘ aa! T 6.5036], | Given a Fair i= sided dic, analyze \_ how dhe probality _disteib aon ok cach \ number _affeets de pec heel values What le cto tre outcomes £ dhe | correspancling nrobalitice play fn detesminky { tk mean Gol? Break Gaon dh calculation \ \ mocess ‘to ereplain hoe cacy ndividua | "hum ber contihutes to dh veel t ecpceted rgar\uc of dh volte h Vox | pcre | x pce) Ghy ,= 2 ax ste 3 | U6 we tears - Ble) 5 panbelity We 32 2G 2 Lach oct cane 3 | Ve 15 316 fora Pair six Side de * 16 5 > 416 ct = 026 Csi possible ou bcans) S Ve Sex 6 - pads 4 fr Will Yo Geet ppeete dd) \ [Btn sheons Lz s 21/258 \ \ - pen wall 2 125 Q4. Give dot o binomia) distetbution has 4 teen Tk 1 vaience of €9 calenlate dhe peobality wacdly 9 sucresses. Use de binomial Atdddbutisn fomuls to detamin th value at n Coumber of trial) 2 20 probe Lid. O-success), £ thn ¢ompuk_PCr53] |_Gtiwen Mean th p> 4 z Nawence 2 npq-> 7. oe g p(e=3) 2 2 pqs F a, GC) =.@ wt : ‘A 9 a ae qe Bs gt. fee . j FET [eae 3] Dated: Page | BN. TS given, | pys3\> 8c, po. 2 S68 CS5\3 (8 \s Vol 77 2 36 O.6653¥ di000%6 \ 4 6s 0011 T9) ile ¥ 3+ _ binomials Aistathotey . sith. 8 doig )s Veo probalidy, Sh siuecess equal. ty \ catemey, Anolhege sik _pabalit, af Sracth 3 \_® ae feast 3/4 at eah access, ~ONE _succeys, te OTH TT abolit atom fod = 16 ate _ = 36 ¥ C413 x C3) 4)3 = 36x (6. 015%) x Co.ns)3 ——__ / = (rsa) et Now, p(rd2=Nt Pp Se SP Cry et z | pordor)o J —Plyze) =f-O-f [> porr=tyeo-g] op [oon] Qis | Calealak an unbiased comm ts toss cig hob dimes. Shatis dhe pidbalid of oh Fein fey L:@ bess than. 4 heads .~ ~ of: |® flor d¢hon head s 4 5 — | Given? pg Ceoin inet ds eight dres) pet f-qei al ry @less than 4 heads [pereay] pC re4)2 P Cese) ¢ persr) tnCysr) ress) Now, BD ys ttre) 1 PX ane a be Cay Cnt EB FLY Ie 0+0839 I PY=e) > o:0039] G) ptren= Fe, CP)! Cay Ber x A On)” w]e Bx 4 0.007). 2 AY O00 | PCre;) Ss DO SL =——_— Plyos ya fe Cae Cy S24 0.0639 Pe) = O-1e92) ey Pees . 8 ) C3¥ 6.0039 fs] tue, ples 4) ez ple =d\F pc =o\F Pre . | a wo) fp ret) pry oa) fries x] 2 © Men than 5 heads | poo] pcese) ¢ Plea) d pcre) Moe, ee iing each tot ptere) ie fo, Ch 6 Gbytes c Le 27 229x001 OE pce 2s ) > fo. tog] - peeete Sc, ¥¢ (lI CAy a = Pro: 0l5 a “0:25 ~T[erele Fee in) Ca)" : fae 2 plrceye piper) frat) —T 8 [e940 [2rd 2-002 —_ enfeasy — os) Ho then orale Pethod) Ser eee ol ) ppd s)= Borne ——— n a a & eee ee oe on Date LUMLLLC Page ..90. : (ae, tay ‘Pep : ars ON Gi) Cie [ss bites ey de ble (s ; ~ ; . fie aie = Arrow find BQe). neon oo iz ne PCr) a Ptr) eas, ae 3 246 6136. 5 3/36 DBE | Ss | 4136 20/36 e | Sik. Bol 36 1 ble (| 42836 i Sul | 4196 go | 736 | ee ee ee W fone | sapse I 1/36 | (36 Loops | 25/5607 ‘Th eppeed) Nalue ot th cum of dle’ feyrces 7 pp tr ch ober 8 thoy 4 BORIA9. eye

You might also like