Ca) nil 2 : Gb Mgo-vithm | An algeatthro is defined as "A aomplede clear piri number of Logical steps te Aotuiy a specified prrblens", =) Simple Algo vithens Qo wile aa go xtthpy 1 find out dhe Cube % a nD. SD Stee si Lrpwt pid numba o @ Sep 2! Calculate Hair cubes as C= AX AMA Wher CWS a@noths numb Step3: Dishlay ¢ Stepy '.' Stop Gs pve 27 algerithra to pind cat the Simple intrest when principal veg of: interes? and tmet IS Frer SI> Lt the poncipal Pate of irdereat ny aad tine t 22 Per The Giinple interest x ud to be Cole ateal by wfommuls, ao inate A&plaged = low Maori then Ske le Input Pinclpel a P . SkpP 25 trout vate of Interest as or Step 3! rapt Hme a t Step 46 Calculer: Herr interantes “ss PAARL HO-0/ Rhee Lis anothy Numba in Wh ‘Interest Ls Step 54 Dishlex 1 Sok Slee 64 Stop -2Cb) Algorithms Raed om Th ~ else Sheteme7 “60s th £44 Dik an clgorithra ate incl qredttint crmang thee SI dat ath, and 0 axe three numbers Slep 1! tapet numbers arb aad © Shep 2 taf ah thes greater =a else goraia=b Step 1 ap qserter 2 2 then qreateat= grates whe opreater TG Skee 7} DicHoy qreatesr Roa Slop E44 bake an alge yithra cle cheete an integer fr ever om al / Sols dit a be any taumber » Step 13 Taput on integer a Step 25 Glade Hur remainder a R when a hinted Gkep 2: rf Rao then Meflay 2 > Even ele dachlor“odd? Ske 4 Stop. a shlecs “odd Agorithn Based on Sterations, Gs bite on akgorntin tefind pre Gon of Per no. Sets ut arb ae too numbeu - Step 1) tap birt numba asa Step?! trput decond numie as bh ie Ff b=o then gouty Hep S bY: usu Cb 40) Bo Bepin temp=a a=b ne b> vemeun dey 4 tem? When Hviheslty & Step 51 Sf azo then distey We Gannot Pind que! elte display geedts tas bind ge Sp 6} Stop.2Ce) | ow Seascking '- Et in tre prvcens of tocaling an ” ®) element £5 a Misd- The general Aearching. prvb ler ty -Lfined as te decal tho positivra ef 20 clement 9 naa Lisn ef stint elemertt ai) Qo ,-- y Qn er Conde le that ct bb not am the Ls, Tioo Most Commonly Used Learch/ng Agovittrns a D dinear Search Mgoaitnmn @ @inay Search Ayoritn OD dinear Search Algest thm The Linear Learch gs vFthrn begins by Comparing yer themed a1 by Ht) HH Q,> ram cfelution Lo the docatyon ef a Say ds, ty 27% Hen Compa % and a, Bf 2=ar, te selatia, 2 the bocatln of a, fag Ind 3p xt Qa, ten Ayerithm or hina Sench Yperthen Trput Qiras,_.. a5 Step 4 bot phe Indegor % +o be cearchenl Sk- Bo Let fa) Step D> while CLE and x AQi) Acpcat Skp Ty, Otmerwie Jor Leh St¢pT fs (5) stp s zy 647 dren Adidplag -bocatrn>7 Step else display ofere! ho cat'as = ° S+4TF > Steg,D4) @® Binay Search Algortltm— This algersibm wted when the Ws} Conapwites of She teams n\n onlen of dnceza hy lee By UE dhe rhmber are eked sem — Amallesd fo ctarges aod tools ont histh 9 alphabebical OMdA eyes THA algovithnn posceedt by comporing tru Clornet bo Ire Aecakd wy the micelle ron of Hu Lbs fru Lt Ls Aen epttr frto der matter sublichs, Fhe of tox Aame sie er one of Mar tepe Smaller seudlesl hes ene tem Less Han the othet+ The Search GenHnuea by AEAHIH DG the Leach ty dpy appr protect sublist hasedh om the Comparer of othe elements Ad be Located aM tht prtddle term, gexttin fer Binary Lear npot ij; A2)--9 29 45 Intreanty arden Sth ti daput. thee humber x te be searchud, SHh2: cet fat Ce as Left enclfetns earch Iipkerrals set fr (fe Anget endp ott of Abarch friewD 31 white f a5 then cart ~ SHB 6 elie j= SIAT4 2h 42 a then Msplay Locate, ~ } Skpsi ele Lis plaug A4eteten- o Sdep 9 It ShpGraph Theory D Graph MN graph olenvledl by GQOUjE), F 4 Consists of wlioo Als ¢ GA non-emply 2th V= VCP pohase elements Ame _ knenn as vertices er Nodes WA get E= ECG) of Unerdercel porins of datinet elements of V called “the edger 6 Fe vertces to Dordean of a Gaphi The numba »% " geeph is colleol Lhe orden of grabs, > Lice of Graph '- The number J edge th colted the bbz of agneph- ae at oy er b e Tn the above eee O1> farby er fareh, Cy= Cbs Ch, ey> (broth and es= {aa ot edger. 2 doops Tf 400 end points of an colge ane hams ‘ then the edge 4 called a Loop. Larbitid) ee verte and > Faraltel Exlger'- 20 edges an dalct oto be paraltel end points edger if they tare Sanu par x hitine- Ft in abo know as multlble edyer . En te Graph xd geo ey {bby Cg ddid)or Lexps CHa by CY ond toe Kbicp aw Parallel edge. _ i amLO Types of Graph eee D Aimple Graph }- N ddmple Geert GEM E Coviorieg fa Non-emply Set Vag) whose elements ane a meen as vertices ar nodes St BREA) of Unedercal pole O% MSting 4 Clement of vy knom as eolges WO its fice from Loops and porated edges. Sa E7 ate feof Loop d c D Directed graph 1- $Y a graph wr ° 2 abowed « multiple edges but beops ae 3 A ee > show Ha Lirectin, of the vation - a b © ©) Mutt geaph of a graph te pret prom Loops but perallel edges are alle nats 7) reudograph An undiAeckh GAaph xo beh parallel edger and Lrops ae Merwed br ced Preucle graph: a c L(b) Null Graph t- tn a qaaph Que y Vl 2s ole het = Fg) ao ernply, theg the Hr2bh GVO) 6 kao as mull graph. 4 vy “4 vy ND OY) Aiviel Yabhi- A gabh which Consis4 of only o Aingle arertere And me edger wey Called @ drivial queph- GO Pinte graph! rp the guaph aevied tos fentte mumber of vertices and eolge Pron Yaph Q + called a ~fihite graph: C4 ay CF tabinile Gonph tA qrehh wshith am mot yesh os know ars an tnfrnit gxohRee Deagyee of, a Vertes s The degeet of “ verlee Vv 0%, oo Yuph ACV) 3 equal 40H, rumfer of edges wo G whch ConbaPn Vo as cng Omd verter , cotcep! thal a Joop at a verkawx Conbibieks batee fy fhe dagvee of Hast verka Nowe. A leop al avers V tas degree 2+ G4 Find the clepree Vv a ec Den VE V4 Oo Ve ee : > cles Cvyj= 2 des CHS 4 dey CVa)=2 deg cy) =3 cles (Ve)= 4 dep (y=3 dey C= © = Lnworning depres and Ocedegcing. depres |— da a Urected peophs the incoming. degree of a verkax Vv is othe number of edges rb+th V as Hair Aerminal vertex or endire verey Gt ts darokel by deg CW os inces CA), i Tn a divected Grrphs tha oustgony egos eB a verte v Les he number of cages Vias Huby Initial vertene It do henodes/ dy dest Cv) or oudoley Cv), 4 Pind ~the indegrec 4 outelepre of each verley a S!_Ges 5 ( }« Outdeyree Fadepree 4 es destlas=} obey” C4922 ce <4 a cles? Ch)=Q aay” Chy=2 deg! (0) =3 deg” Cod=J dest (4)=0 ley Cd > 2 as aiGo) Types of, Vewh'ces x . Let GOWED be ce qh, Then Ela worteen or fedora types A) Adjacent Vertes! Foo vertices Uand vo acts Gq a kald ty be cidbjacent, 24 athe at Gonneckd by ao edge e=fu;v} 1" G EP OVI Wa YUM, , My) CY, Vg) eter oe Ohkacent in Prphy W) Lsalaled Verte! A veiea of degree rerm iy ealteal ao -irofaled wetlep or a irerky tetuch 44 not adjacent lo on Yo Otler Verbs 5 callrol G& an "oledeet Verley, Ep Vy 6 selected pn eps | WWD Remdant Verkn !- vertex whith hes only on edge . < Inctelort om 6 Le caltecl aa Bau es percent th qraph a. “ee UY odd veux 1-4 vecle of the FePh Ge aarrel te be odd wy 3 ; S44 pune. © oY ih Agree iy an Ey ery = 2 aaa dey Ma, 2 (4 Even Meteo 1- A vectem of the geph G 4 sail, be eren q ba 4 i epree Ah ancien number ¢ dey Y= 2, deg (5 =Y, aes (VQ IRD, typ py y5 uy ea Moen Ma = xo] oom | M4 VL Eg NGNp €d Vy D> Fe “tie graph chowing mie aa en It C10 a legyce tach verte (1) deeps and porated edgv (WY) dsotated ard Pendent vetias , Sof%5 det GEV ED be the pen apahh Hee Ue L121 Vay Var Yor Ve, Yt Ee fei, C27 2, ty lr) &, Cry Cn) cartier ey me ere hyay = AV 3}, G24 Vavep eH i Neh Cs Ava My Y R= AY Vy 072 My vyy C224 We J A= LMavgy es oh ney ee Lui} @) ces Gy) = 6 dle 0) 2S des (%) = 4 des(Vu) = 0 dey (vf) = | dg(V¥7) = 0 ae (vy) = 6 CY) The edge ene MY Vy wb Loop > The eal ge» Ce amd €7 ar parallel eolges as He, _ Mave Larne pair of distinct Hl bA Wy and vy, (A Abe 9, G,tyo 0 parallel edger- (1D Me and Vy art teolated vestice, as obey CYI=° et by CV4)>0 es Vy 42 pendant vertiy a deg (vx/>/.(HS. Some Teareme on Graph Phuory . te) (1) Pulea's fist theovem 2 u Slotement !- Shoo thad te Lum of clegrees oo vetoes tn a graph Go east to Ihe Aote Une number of edger tm Ha geoph, Boot} ter GCVEi be graph Hearty the celges in the Lat £ may a may not be a boop. Now dg edge © of gaaph Q ss a top then tt desree 2 om that verte and af an edyoe & Ret a Loop tun iY Corbibuses deyrec ore te CaN of the 00 Uischinet vertices on wshich id 2 ineidew- Le wher dhe degre of the verliter ant addak cach ge conbibutes alegree 200 In Q graphs a wetas each edge is counted exactly she times Hens if cH one in eclges in a graph tha, Qn = dep, = vey 320) oO Le fom Dy clear that Leu of abeyrees af all a ~ Ph DB On d Pore vf ehzoh ing ol ; nee weties in ant ewes wag euctelezree gioatk Poof \- det Gee) be a directed graph. Clearly, the edge in the Act F may op may nor be a boop. This cach Containing, clegiee 2, one as in tao second al ocottepes “Fer 2s res Becaun cach edge has a begin’ Mtrtex aS wel/ as teaminal verter. Hen total no: 0f WMolegree = “Lote no: of Z dy (vy 4 jer Neb tae ng Bad 22, ds iE| - a) EL) Prove phat Every graph G Aas 07 even re! & berhins Orld clepree Veky Preel, Comvider a graph G thawing er aoe ore Noo clividt Haute vertien fate 220 geup! one 10 4 been dlepce and other with veatios op odd degree . kt As dum of chegree of verte With Oven epee = dum of clezeee of verter wath odal hegre. Heine tan of deppec of all ert Let n= dem Nev, sun of Ae dlepree of alt verhlin bs oreo f OY BLT en eee wn thedvera} No? , tts an even nurlba, ar it ts fhe Aum 06 deyseer of vertices rith even depree D y-A br am ever numb a a Dm Wo a eed nembey Alioym dn the dina of Aeprec wf vertices ntth odd beyrec “an ts the Aum of Aome edd no: Thus, 40 Make m On cred nor, no off Odd neimber muyr bean even number as the Cum of odd no of Odd no- 4s always odd. Hen) the noob odd vetters must be een, (TS) Prove hak Le chepree of ony vertex ono & Limp graph J mn vetiets cont exceed 1-1, Proofs det Give) le a dimple gph of 7 vertices , > Tf the gsoph is tdriak ber Guaph combrin only single verte and no edye, tre we have HK plerired result, Suppo that graph in not tive» Sinee the Simpl goaph Aad neither Seep nov ponalted ed ge>- deb be ony eubitary vert af graph G, wey ed Telh 4 wth then ty cant be tonnak¢ Cie” ob meth Gn 109 tne are no pawvaltel Thu thee n-l vation con increase the clegres of V bg 7-1 flee 04 Phe ae no hoops, $0 verte V Con} tnerearnc ty deqru of itself: : So the dep gd v 4 atmest n-/, Here, pre Aefrer of any vertex bis tleneced nf,rr rr rE TE in & simple Theoremi-- Lhoes that phe max. nov of 9? vo eph my mventer is no, 2 2 of n vette. e ' tt Let GMIO he a gimple grep a irl an adeqy Lis © in atmo Me Regree of any Mrertent 4G By preniows the} Sines the ora GQ har vestiees Tre hum of clegsees of, elt the veces fn gh 4 as celmost a(y/5 Peo UB, destviy entry — O Abo we bro that the durn of olegrees oF, all von hy graph a 44 equal to Hho poles o4, nurnber of 2 edges th gath a, Baty (vers 2bno: of ety” —@ we vfrom (D ovo (2) DCno of edger) S mCn-1 =) No of, eolyes J n(n-)) e 4 . the no» of edger in a stnple Graphreh mnvetkien as atinest = mln-), o 25 Hence the man not of tyr in a sim ple Graph Buh om veces ty ectmest (n-) Ve * (2) Sum eb chegrees af the veshtes 25 tele the Giese (hth number of odd yertian a j=) Some Special Type of Graphs 20n) Ca) Complementarg Qoeaph '- The Complement of & Jreph ACU) 1s clefined % APL Gily,@) pwottch har S™ of vrestleea a0 tn geeph G and ta verti in Q! ot cormnected ify they me hot Connected th graph G's the verttes WU and Paw Connected BY an edge hf phene 9 no edge bo Wand vin G. fa wv a w AL LA, Va 7 » Vg My q qt Cb) Complete Graph '- A Atimple graph GLY LE) sare ho be a Complete geupr “ff thine to Crakly one eye bho exery pate of lst net veriies vg, ky where wa Ly - Id denvted by es tak, = no: of Wertisco * Reqular Graph LA geoph ALVjE) Sarl to be 4 Pegler peph tas, clegrer hth Verhasr Li the per? Ove Sarne+ "Af MSs 2 Reger Jor. 3 Regulen . ve AH Weighted Graphl A grabh qQ + Sald to fe weiyttol Hyph al cach edge © of Gr erga a rnen- 7 called nied ¢ negate Acal rumen ek ar gor ie qo ® > b © &) Rf partie Guapht- A Simple q-mph GUE) 4 Sal to be a bipartite graph af the verha, oh Act V can be partimed Ind A20 subs 2 and & ‘such that everg edge In the grep Gq connects a verty 4 Pa verks of Q + @ Tt Os denoted by GU a, &) ey Pla;e@) Q=4 bi, }Ey Pekerwmire vohether the graph Gia ly a bparh, 2(b) Set at Gtvie) be rae pirea graph , whe Ye daibres aye, fp aad Cm 40ers MUleitye, Ce LQdy, %>kaep, Cy-thit h, Ca =tody SS LGFE te=tajep ond Cyto th det Vi be partitioned Inky boo Subse% fart Y Assume thet verti dare a veka aE P, See a ly connected wilt, end €@ mut belns & 9, © P{ab ond Bz fde pemaeres vertex d 44 Qs be cbse that ad & Conncek 4 " abc and e. Bat ew already to Q vtuch HS mot pombe 1 bi parti opaph, tent Gis nt a bipach te rp, 2D Compl Bipartile Graph !- A biparttle goaph ab Aad to be Complete biparh 2 Uf tbs yeotem Aet V can be porthitned jrton mo Subtes Pancl Q Such that each vevk of P 4 comme + cach verter of G +e an ede 19 a LEY denoted by kmyn whee mena m1 are ithe rer of(a Planar Graph i- A Almple Greph or AULA VGN NAT ay Can be drawn on plane 49 buch a Peay that ib edger do mol Choss tt another except at commen véelin ie called a planer ganf- we daw ky a M PN M va 1 Shows Ahat -the geaph Shoron + a planar geuph a Get Lt GED be the guapihostene Ve Vy Yop V8) Va Us) Ve $ Ea het ey Sp Oy Cy Co tay Op) Sr Seen fe The gher geabh ty not Mane as {VM} ond AMY, intersect AEM} Aye (VV } btenset Ny Nor plane fexph(8) hubgeaphs 1 A subgrph HOVIE) bo arb 6G) per) 43 A gearbh by whch VIS U aod elee les edger and vette of gabh H na the Wee hte oh ay 4 {a vy a a v, y en KS ur & » dy Coubgeaph) eae @) Shanning Subgraph i A Aubpeaph H of @% wun obo be Apanning Subgephiy H Contains all the vertices J Vp oa Q, b he TL Le aq H Lspamrsy suabyofh Yy > homorphic Graphs at GOVE) oma GlCY ED autre Simple 5 Thee G and q! ae cat to be “omnes stunt exits o ent-ont, onto mapphy fs vov' cuch that fu Vv} > Gn edge of G ihh SF k fous fl} oD an eelge of G', 53t bb denokd by Ge q!q . Guafbs Sot der Qevie) and Glov',e1) be Ake Grrom ger ve far br dick be Vie Li Mer Mas ar ip Ee Chai sel O57 Cer Y Elden eased s Oe! ree, ey} So they both have game no of vertius and edge, Nao we ful oleyree of G ant Gg! Gq al dey (a= 4 des Cvi=Y dey (B= 2 oles (va) = 2 dig le) = 9 des tv 2 dy @)- 3 des (Wy = 3 des C2) 2 ches V5 )>3 det 49 defin & apply fivov' So fld= wi, £tW= Vi, ple)= V2, FW? Wy and flelo ke Clealy fF by ome-one and also s\ Gmd Gl oe seomeple aie Gag! &) Aelf Complementary - A Simp graph Gv Sa to be sell @mplemeitory G + compleme Ubomovplic -b it; cComplmes @- Yr b a i al I, |() Homeomorp hic Graph '- Lue gens ; ae tatd bbe homeo #8 hie Peabo if bh G? can be. oblate ifr goth & by | A Lequence of subdiielns of He ego JG- | ITT <> LW Adjacenc: Mat Represertert mo of any Grup h | Suppose that the guxbh G of 1 vertles eo UiM—w, Then the adjacenap omatvi x A of qreuph Ga ngn mati dined by A= (Qi) whee * k "E Lay ouj = { Wne-g bop) tf Om f } Othe ae Ss Pind the adjacency mate ) He graph > 7 ath Sel" Jane veces ae Miva Va7Vir Gb 4a ord gph Av The Size ) rman 42 x4 M Vo Vs Nu uy I ° i | vo ° oO | ie I ° l I as o-Ppa, +» find tha gear whos adjacency Mas Q-> find the G o fin BO: I 2: A v}/loo uw | ef! 2 1 o al? 15 © : sat cide, Woe Z ys ven Lol" Here the ovcler A) amnabry 69. Upp Go tt hea WU veahiny LT Ayhy ly ah ae fhe Vethies- Now wrth by ye geined Beg 7 LR) trdlelenee Mactix Representedh'en ob Slnple Graph; Suppose thal a simple gph GV, 6) Const's7 of N wetites Say Vy yVayn--)My and m cages eyy6)- pm thes the ineidence maby of getbh Go th Xm max Aibinod by C= LOGI when ous f VY edge ef a3 Incielend en vetlen Vi ° Othe. Sy Find the jnilidemce matty of the Faph bes _ Vy__e vy ex Is a) vy Vy. Sat* “ Lo det Ve hve Vay Vy On Ee Aen er &2 ey} A The incidence mot of Qt, ord Hy Y dr cs Lary yz be the netlin ce matly 64 the grephg Tr the Grohn q edge ene {Mm} Her eclge ey Connect the verhien vy and V2 fo Cus!) CuslFaye C2 = dV2 4b D Gre Cog> | Ee Ealge ee AV IV3} 2? Carel Ca32) Eelge eye de, WY > Pzy>! Cyyel As al otter ewhier of C ann tA” Hence He treidence matry d) G 14 a-[}° Oo P to Bie G o loo, >) dreidence Macix Representert oo of amy opehh Hue e1 in aloop at Wo Be & & Inetdend onthe vertay Cust Glge ey2h Mie) 2) C1azlvond Gar] Edge © ={V9%2}2) Cpg=! and Co2> I Rly Egat Vayvzy Derysl end eye = > eye es= (Vy vs} D> Cage nd Coca} #8 €o> fV2yVs fa) Cayat Od Coa “t= Ly vyy = Vy Y=) Cyg=| and €yg= HH ey iy deny ay mI AU meat entrics in vecke My =) Cug4t a Wily Oh @ Gia Olik Oy Lb o Oboe 41. | 000 Co FDO C11 OO OllooGQ > Fnol eae Now ple hh se helbence ; nai ae thedideder sonata Nal a e “T 20) Lew} oO 1.0 | | oOo 1 oo} 9 1.0 Lo Let QEVE) be Ahe gee Q omnadar B Hee the order dQ ™matiy Bo» ‘toe Se Th qG tas Y vehi ond S ed geo Fey hry V9 7 Vin Va} Ea fey Cats, ey per} Sis a} Vevey} e224 UY Curd Vy uy y tyke Ve } Va EA vs ey & wy oN, VaGe) WALK ei 20 A walk Jn grafh QO, dx an atlernattry sep rene eh wetter and edljer acthe fre of Vevey Vi en — Emer Viretien, Vn fuck thar ©) Cach edge et connect “the vedicea Vp Ant (7 “the Aepeeneo wo & alter necting Acquence) a velee may be AL - 7 inesnen but an eelye Bo net be rep CrrE/, ends at — a nrertoe “The walk Uy pap V2 p Cry Uy Os Vy Cay 7 rodength of the hulle! The hiombe of edger neritic a boclk in Called Seng} 9 axerlle (4) chen Walle! If a walk bepin and end With the Werent vertices 1 then at calbod on Open walles Cr) closed well - Fp dhe Initia® anc dersminal werhiCes of, a walk art Some dn 4 4A called a Clog. psalle+ ? tices ane Ai'sting, A palle In hich ale the Ne a (4) Fath) eros posribility Voz Vin win Collect, Q path, Notts ALoop Lo net @ pethr Ys In G M5, 25, Varro) Var esy4 42 pty.20) UO open Path!- HH ithe Slacthy and end vette,” ent distineh ah 0 paths () choceel Fath Jf the Stortieg ond endl vectiar oe Same in Q Paty > CARCVET A circuit or a closecl path 4 & pat whidh etait anol ends at the Same very =) Stmple Crrait!- df no vertex peperdeol In Hire Aeauinee of athe clreen"t creep Vo>V, 7 r &) Sulertan Paths aod Crrcart, 8 SS Buler Path +- An Culer Path +> a yrph alrye) YA a peth phos edge tet E Contains each edge. 24 Hie aph_exactty once 2D Euler Cdeutt|- Arr uler ebreutt 18 a chet roe FePH Gy whith Inchrdern every AS the Gh_ezac enee- D Euler Geaphi- det G be & Graph “4 thas ex's on . Euler pecth im graph G then qrath 2° G called am Euler Graph or Luleian apr, 24 Pind which of the folio sry abternaty 1 teprenceds eo Euler path mr Cutler Civeutt S The gh vy a Gy ver Nor ey Vr €2,V) G a Mm Dox (2) Nie ety Vas 025, &2, Mh) &6/ V2 15) Vasey V, , xe hie ne ann a UY thy Yep O37 Mp Be 1 M27) 2 Vy Sol) d) tbo @ path, Abro etreeu'?, But not Culer peath a . Clin cbc 2d —-theg ol0esnot haw Cy, 05 ade UU te in a poth, ater Circuits This path to Suler path orl Cuiley Qreutt ale ar Lb coprelnas all He edlfe enacily mre tii) te 204 peth, but not Ch vauit ay stathg k endly verter trol Sams Bt ts hol euler Poth 02 Cy Ao not Inctactest. Jate) Connected Graph A qeph G 1 kaidte be a Comedod gaph 4 Thee 2 @ paty between eng par of Avo vetias of F 4 eal y v oy ei) CO Disconnected Goaph'- If a grph ix prot tonnecke then Ls nol Connected > Hamilforiem Path - N Hamiltonicen path i apap ———v Q Ba path whew voter @ Jit Contains cach vector of the gaph exactly ence eccept fer th terminal vorttes of the pert. DHemittonion Oeutt != A Hamiltonian Creel} ty a Feubh G 4s a Hamiltorie~ Pan 40 which Initial vette 13 Ganw ood fin vet D Hamilteninan Graph A Hamélttonion gph 42 a Pon Hed pesicsser a Hamcl- ~tenian Arcutt> e ey v>. 2A os Nip V27 bey Var Os, Wey Cy Ve, 85) 4 Vv: wo Hamilterien Crcutbabe ts| Jeg Hornblertin apoph- Ve> ea Yy