Scribd
Upload
326 views36 pages

GRAPH THEORY Notes

The document discusses various types of graphs in graph theory, including undirected and directed graphs, their properties, and definitions such as vertices, edges, and degrees. It explains concepts like simple graphs, complete graphs, bipartite graphs, and the handshaking theorem, which relates the sum of degrees of vertices to the number of edges. Additionally, it covers the characteristics of cycles, connectivity, and subgraphs within the context of graph theory.

Uploaded by

casesab831
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
326 views36 pages

GRAPH THEORY Notes

The document discusses various types of graphs in graph theory, including undirected and directed graphs, their properties, and definitions such as vertices, edges, and degrees. It explains concepts like simple graphs, complete graphs, bipartite graphs, and the handshaking theorem, which relates the sum of degrees of vertices to the number of edges. Additionally, it covers the characteristics of cycles, connectivity, and subgraphs within the context of graph theory.

Uploaded by

casesab831
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
LNIT=V CapH THEORY. Defo> A Linens gph or 0 graph Ge (ve) Consist! collod vertices and Ya sk of objects vety yt E 3c, 0, 4 fh we 102 Nf Sek of ed ee ' ao sotd to be adjaoob Hf Ate % Va and vy Aan edge ex = Pov An Undivected graph Gy ConsiAta bck Vv g vertics and a wh E af edges such Fal each edge cee 4 aliociotel wih an tinordétel pair of vores - dlivecked graph tox clignoph) G Gorsahg aset v. gq vette: and a set & g edges uch fol eee abotiatsd wtih an ordered pair voviien. 1 her cards 4 each edge. oy fhe graph for a direction han Be geph Bs Called — cyrecsed Qrph. In > fn edge 9 a graph Mok Joins o node Cyerlen) 2 rtselp Ue called o Leep ov gdp lop. . Man era. edget ora + por g podes —jomed dy More called rnulliple ov parallel edz. » A Qroph Hat has nesther sey Leaps ror poral edges 14 called m Simple graph. ant all Ke often graphs Ave called poulli Quyphs ¢ The deg of 0 ites V Io undiveckd Graph Bb cjucl fe the number F edge gtr which are rrerdonk int with selp. Loop Counkd Arce, Te leyee gfe roth gph a may be donokd by ACY) or egw) vino » A gmph in eahch Amps and rnallple edges alleoed is Called a preuclegrop> » A vole op degree 0 Bb colled iselabed o pvorkn a degree | Yi cole Pendant 7 even called qed voters. > pvetin ga poph B degree us odd or Sven yelien clepending on whefen 78 “Theoven !- ( Handshaking Hever) Vv. of Geer be an andireckd graph with e edge theo a ey) = ae. tev (The Sum of degies a fie yatfices tn enunclected guph is even) S Pate ince fe oegne ga voIkx 14 fe. PumbH a merdene wi that voter, fhe Suo Q Fe kore. Counts fhe. fotel numbct oy %& brmet a” edge. B intrdent with a yorex. Sime eves edge 2b inCrobnd worth exactly foo vertices, each edge ges Counkd Pwite, onde at each end. i fe Suro q Me Aggece exial pwice. the Dumb gD e a es 4 = vev eg) = Re. Tterenn — Prove Bat He nunrber don @ vortice: eae In a graph +b always eves eet Late Bf we | Contden Be vorte th esr) vod. eee degrees — Seperatily Oo odd @ We Kaeo Rak Dendy eee Jet cwhone Cow He pu det q 3 he pum y edges and Ve + bo keyron vires, 3) = AW) ~~ i x ZA, a = dO), ae oe = diy) 4 AO), odd © = AW) - a ze = Ath) even = ENE — Even Cy Sum 9 xen no. ven) = even The numb odd vertices mn 7 tA even aon cegee and ouk degre = gn a direckd graph Or. rhe ok clegree Fo VIA RK Vg G, denoted by outdeg() or ten) A Phe. rearn be a edger beginning ab wv Chang) Crnerdonk oot 9 vorkas) _ pa indeger 9 0 donk Pag? dep) Ds fhe nurnbst 9 edges ending af ve Crmtrelend. infs >), 7 The surg fe. ndeafee and cut deyes g a verkx Ub called phe dol degree of Ae verkx « » A vilken. wilh wre 1 adogsee. 4 called a Soule yA vordea unfh zero out deyrer bs Called afiek qs of [ne Cie) be a cheetd goaph wih € edges Aon st ca desta) =e: Pama a 9 (0) e (The Se out desnees 9 AE verses go deograph Gr equab the Sum 9 Jn egies 9 The vorkiter whith uals ta pubis gq eclges rm Or.) Let pny dliveckd badge, (4) Corrtrbules 1 by fhe indesiex ay UL and |. fo fhe. out ceguers 9 V Fosrther,, afoop at V Corhibutis ' be Ths. Inckefiec: and I by Be oul ckegree gy V e Shoo that te daqier of a wien 9 a Simple Jeph Geet varices @n not et Cood (N-1) bso? Jet be a woitex 9 G, Ine i 4% Stop, no muldiple edges er Logps de ollsed iv o. Thus F Can te adjalent fo atrnast all fia. Yernoinng (n-) vdttices | G. Aente Vv may fave maximum degre -) Han oe eg) an for all ¥ © Via) Ini JM in a Sinple. graph er ieein, (errs a a eee) Solulton Shoo Thak fe rearirnes numbett op elges by the. hanshoéng Beorer S dun) = ee: ae uhde. 2 Ls fia. nurabe 7 edges with n yertices 79 Ke Jryhlr, > dAnjrdd)r~ +A) =2e. —-@ Erte. we fenod Nek “Ver -mootimun degree. q each vitHex mo atop (Con be Gy-1) - TMhuke Gore. expucttion On-") 4 =) 4 ® ve dues + ko kets Whine Q-) = Ae = ae WO) = 8 = e = ye) aioe Wente Ate Nmedtimum rniodt o} dgea oy Am ‘Stmpla— RE GM sn watias Hod a ae a we es The a Semple yoyh Covredpondine bo Tre Fellow, agree sepusneat? G) Cray wo (22,4.6) Sclubten = ae WD Whte Be Odd Numbd!l (2) 9 odd degree NSthices VV and3. Bence, Hehe entsh no qraph Cony eSponching, Ye AWws degree SHusnce » DP Numbeet 9 NOMA nthe Graph SAY uence. a FoM and die vncdiimen MIVer Gy overer 26, alu 4 Wale posse Bs Tr ena arene Anges Gino e7rsh on A® Brom TH RUmbeT oF Varkees, Sle, Pees Or, Ore Gaby ON Cs sakisfysng — how, dagred (33 45, £6). Sie Suypse. Troe ent Gap Wh Seves Vetice® Sarash ying, AN Pe peopernes - — uso NetiTes het Aagres 6. ok ge be yaror B adgack wth ody othe Voter, Bence Soyer. G Coch NOHO bleak 2, So Vhok “tre yep \yer vo Vota 9 “RQres. \ aech ao Conta ketion. flempr Wea does Rak esis oy Sm¥e- graph ost Ne Given pepadas. erer_s)_ Grothe 7 Mull_Creagha = j 7 A Jpoph hich Contetas ork yeclobed node Je called ew alk geih awe Sek Q edged wn ark aap 4 empty - a vee by Ney BB yes Ne ve Ww Complete. Grraph:- A Some. raph Gr ad Dak ke be, Compete. VE evéty yotter vy Gy ak Comeled its eidiy other Nallex, gag Gy Contam ercoctly ove edge betwen cack pay 9 dines othe. A Complete poeh Gb dually dened by Ky pi sheald be rokd Het Ky has exactly NOE) edges. “—- aun® Ky Ks kK, Rasulo breaph + 7 A graph in whe all verices oe equal degree ui Called a regular Jmph Te fa keSree 9 each ydteu J+, Pen Pe Qrmph 4 Clled a rejulas Jryph oy hyve. she Complele 9raph kK, 4b o vegulet gy clegree (ni 7 whoh th tha Sree. J amy V~vepelat CP.4)- Soph? Crp a be 0 (Pa) mph Benrhar p vorties and 9 edges) Jukrin SEE Sire A a FH MG HlOM Grp by Me cle fon thea 9 % veguletily Q Gr, we have. log (os) sy. fr ol 8; © v0, By the hand Shaking orem — sich Ria) = eo ays 2 ec Ua a AG) Ee FAD) AN = Pp sade) H Dees Were eartg a Ge vesulod ayoph 9 6 voter" TL So Conshucd a Graph, wee oye Be Aaa FO vegas — graph on & vatheor A possible nk 8 Cortond [& e dees + Bipdhte (amp. A goph Ge CVE) dy Weipdchte oh We voile Sek Vo Com be. pottithroned the doe aubsa Cdigiont) Vy Amd Va SuchAwek

You might also like