0% found this document useful (0 votes)
56 views82 pages

MFCS Unit 5

The document discusses the fundamental concepts of graph theory, including definitions of vertices, edges, and types of graphs such as directed, undirected, simple, and complete graphs. It explains properties like degrees of vertices, loops, and the classification of graphs based on their structure. Additionally, it covers specific examples and mathematical representations related to graph theory.

Uploaded by

hodeeevikas2012
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
0% found this document useful (0 votes)
56 views82 pages

MFCS Unit 5

The document discusses the fundamental concepts of graph theory, including definitions of vertices, edges, and types of graphs such as directed, undirected, simple, and complete graphs. It explains properties like degrees of vertices, loops, and the classification of graphs based on their structure. Additionally, it covers specific examples and mathematical representations related to graph theory.

Uploaded by

hodeeevikas2012
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/ 82
Goh Toy EO | “Graph § | = sy i | A ger? G Consists of a pot Wie) bere vy fo a oon ene frofte set: tnlho Se elernents ave Vevtices ard £ 1S a another get Whose elements ave Caled edges CO (ines) Such that | each edge e€E With Sldered ov Rinddered spas. oy | Cement of V, thot ts, there Sa from the set oF edges E tp the | Set of Sdeved B unddeved poir of elements ofv. fe © The graph q with vertices Varel edges E -G= (HE) @ GWE). _Galled 45 ossoct ated is talritten as | Flaite graphs A groph Gwe) 6 Sodd bo be intte tf Tk has a -tinfte number of Vertices an of edges. Otherwise we is Called a0 joifi If 4 is finite then the nam bev Bder of G ard 4s ckroted 4 finite number nite qork. ot Nevtrces in 4 ts Called the by vq) STE & ts -fintte, then the numbet of edges w 4 es calle) the side ot Gand ts denoted by Ca) - Let Ve{u 2345 and C= (02), (va) (4), (3), Cav) jar J. Represent Kis ‘efaenatfor in the fam of @ graph: oe: Gel &) is a ws) qreph- | This groph ‘6 Yepresented by Ahe diogran, ’ cap i In’ As greph the edges (\13) and (2,4) intersects however-thety tokersection ts/rot a vertex of the | qeph, | —Anothe v diacpam tor the given qreph 1S r \ * Consijey the — (o,1) graph Guen: ihe infemation Can be pived Avorn the quer qorh? | . SS ! ze dn Abts grep, V= {213-4,5r ab, cde $ Eft (apa) C30) MUNK) C51)» Cad, Cub), G3, 9, (ay, CAi#), Cart, cee, 6070) Cbd) sCdvary “The graph 4S. called petersen 2 5 q rattled p qrerh Loops An edge of o graph Ahot Jotns o Hone 4, Wesel fs catted a toop or Self LooP A (00)? trou [be defined as an edye (Muslim), albere v= | Matttaraph i- T{ more thao one line (poe Ayo Vertices “ave attowed fm a graph then the resulting qrerh 1S cated a rosareph: * Lines jointing the Same Vertices are Called muttiple edges oY porattel sage | Sisple graph: | A qreph lilhich hos nefihey loeps ner multiple Models 4 catted a Smpe. qraph- RSS ~ | a | be cbtined aso | thus, & Sim ple é qrerh ue F “get th which each edge ConnettS two distinct gy Yeyttces and 0 “two a Connect -the = pot ‘ Ly OF Ver thes ! Went’. veet pseudogrerh & : mmoltfpl® es are A qr" to which leops ond te called 0 pseodograph allowed Represent > so mutiple qere is \ vy Ny Ny Represents a pegudo quarbi- Un directed enh oe undfyected qrorh G Consists of a Set V of Vertices anda cet E of edges Such that each edge ecE ts assoctated With on undldered por of Yertices. * give an example of an undirected qr | Ao example of ao undirected grep» Since an alge Hoigt ae) the Vertex poly yp and Vj moy be ~ppresentel as ether (Vz, Vj )8(\yp vA). * perked quent iar ame i A dlrected qeph or dteqroph G Consists of } | Set Vv of, Nertices and Set E af edges! Such) Ahat each edge ect te ngcoeteded! With jap Adeved pots of Vertices « ' { Th other tat&ds, th eoch edge of she cpeph -G fos a dhection ben the graph fs Called directed qrerh: ; An example of a ‘ctivected qreee N3 . Vs Tn the diagram of clivected graph, each edge e=(ailt) 45 vepresented by an atiow Ov dfyected Gumiefyom, tettfal point a of e fo the tevminal pant Vv. ' *KTf a Verter vz ts an end verter of Some alge ek and eK fS gid to be tncfdent witth Ni. Tuo edges ore Said toi be adjacent ap they are tddent on a Common Vertex. | + Tul Vevties Vr and vj ae Said to be odjacent “f ving ts an edge of qreph: except | ase 40 Ue doqiee of tat verter >The | | Find -the dene , each Vertex of the graph. + te Deques of a, Vexkert- > The < qerh (5S. -the number of eciges “inefdeht WUth iE ¢ dvr ~G is denoted Ey cleq G (ur) or dey Mi OF ? “the gore rer is’ on Undivected graph; Can Write the deqree of the Vertiter as —foltows * degree ‘of a Merten of an undfyected ty! thot o toop at a verter Cont vi bures ein Oo b deatee of -the ergex WIP TP Veco) N5 (ui) a Mihay a haacay, clegiee Qu j= =. clewre Qn y=y decree (3)=y cleqree Qu ee cleqree (us Jy _ lege (ue =4 ie | | Find ort igegree of eoeh Nlertex of . the rere ® yond , ow) Ny | | y No } : The por is, an undivecked tapb s The deqress of the Vertice $ nse foe Whitten as Aeqyee, (WY) =5 24 cleqee Qb) =3 t degree (vay= 5 hdd) decree Wa 4 | cleqree fs) =! | OA verter of cleqiee zero % Called an! TSolated Nevter [A Alerter V of degree ane % Called an edd | Veytex- | 5 A verter % pendent Sf ond only th tt hak a { cleqree i Consider the corh er = v va rT ¢ rf ng Y 4 To ANS graphy the Vertex 2 t8 4° Tsotated ls Nerterx and Vertex 2 %S pendent. | | I odd and even Ney tices ¢- | @: ¢ A Vevter of o graph ts called an odd pa oy ah even Vertex clepeneltiq on hthether | As oat aa fs odd ov even: Requlov geen To any qyaph 4, wie define SC = wir fdeq Ws EG } ard 4(Cq) = maa {deg wy WEG % z Tf all the vertices of G have the Sime de Ah is : 20 Ahe qroph -@ {5 Called 0 regular e eee of cleqiee “e é To other wads, tf Sq )= ACG IET, then the ‘ ‘ Yrorb.G is. called o Wequler qreph of deoree A sept Yop of degree 3 45 called a Cube “Theo o . | UESIEM & To any graph G, the total Humber of dd-deqree Aevites %S eVEN. poof i- Let GeW,E), be * Weph aod dhe Set Ot Neoidegree vertices in 4. Wh denote the Set of teld- degree evtices in 4 Let U denote Theo, i i $2 dogg tne Bichgg (A EITM NEN. By Ahedlem 4.3, We con Wlrtbe “t) = 2@" a wey deqg ry+* LI leq . Wt) 6 OF eu “N6 Pera oat Aged o> 9e-md eye cke ° e eee egg) roa qq WO =) Bee eg = ts even RES, cleey g wr) 1S enen. view Thus, we Con Sa Abat ‘be number ot Odld-clegree Mertices fn] 1S even. Tp-deqse and out depres of a Vertex Vv of a divectal The — in-deqree edges ecsioe at V peqaen. G n(n-1)=2& — ala) Dee.= 2 Jee eco-t) 2 The mosimum umber of ol er? with m Vertices ts nt ret) eS 1Q any simple 2 “Natt rene t+ Si on sal a { x y fap h tihich vatiore * ts Catled 0 qo! qerr: ae 4: “the ‘Set ‘ot 6° tog Dull qr a Null qraph with Mertizes (5. clenoted by Aln« Example? yi Ny ' %€ Fach werter of a null gor fs telated. Complete qoaphs:- A Simple qrapin G is Said to be Complete if every. Mevtet in & tS Connected with alee Other Vertex, that 15, HF -€ ‘Contains exactly One edge between each pair of distinct Vertfees A Complete graph qs usually clenoted by ke, , si Va A % » f I! s aN if Yoh Bee Le x Meebo To WV A : Le sh b ci $e ie ’ ir Vs cists of 9 Nertices Mpls Vi A cyte tnd #e core ’ 15s Vn Fu Noe Sur N3 en Nar Alin % and Suns» | © | and cages | erie Ny Ne Nu y Sfinkenstidaas a h Vie AN M N3 fice a s | Ye Ye Ra Stok \ 3 Noy Nu ty pA, hlheels ¢- Ys 1 My tess Mier cine Coton!) einen oh cctattioval Vertex 3 ,and +his New j fs -alded tm tHe cyte cri for 9% each O42 thea Nevtices fio Vertes 46 Confected to By by the “new elges: Eromple . 5 Said t0 ke Eipartite tf the | Bipoxtite gqrophs Oe | | disjoint Subsets Me and Vo Onnapito. a> Narten ly Ne

You might also like