0% found this document useful (0 votes)
39 views9 pages

Graph

This has a Definition of Graph and a Related Important Definition with related theorems

Uploaded by

assirtbhopal
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)
39 views9 pages

Graph

This has a Definition of Graph and a Related Important Definition with related theorems

Uploaded by

assirtbhopal
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
Gaeph_Therey * Groph: A Gnoph G= (VE) comints 4 a aur +, obyeela Ve 4, \2,-- -y, whore elomenly are verticed and another Ack = (1,22... J, hone ehomen'a are Colted edysa Such Hath Oy to aefin idenlified with an Unordereal pay Wi, Y) 4 Ver Hees, the verees My and Nj arcciated coith cay unordered Pair Cvinyj) 4, verieeo TRA Verba Vi and Vi arrouatec| with the eee en are saiel to bo end Werhesa Rk. * Sef, Qoop: Ary edge io Daid te be Adlp. Qerp (simply Loop ) 8 ite both end werk vertices axe Same. O* “i *& Pareto! Edgoa or Madhpie edgea: oy) there are 4h -twWo or more thar too edger hasty Abe Ame poe 4. em vertices, Hun such edged are cedtad paoalle| “edge Ce mulKpde ealger ) \ & ¥y edger, C1, 2 avo} 22 ave called} €, es Pavalo edge ve Ye * Sieople Groagh : ® goophy that haa neitlus ae Goopn MY Povalla) edges Vo Cabltoc} o airnpde gre ph: Ny Vo er Na * Mubkgreph: 8 geeph aa ame Pavabbaf ahaa eadgen io cabled mulhiguaph. fn mubhgaph no ded a Qoops ave allkorsed . a @ * Preudegsapis C Geneva) Gaps): A groph Dasiny seme Adh Loopr 1 cabled a Prcudyysoph Ty, Prcudgroph Parallel edges ave allowed. ‘I SS ey 2? * Gocidlemt edge: Lek Vi be an end vertex of Some edge Cj then we Ae thal the edge ©) vo Incidenh on Com bo or eat) uy verter Wy. yy & vu Ss es Edger 24, 0y Ano} e ey Cy aye coltecl Vo en vs nei den) Edger om verter Vg * Rajacent Edge: Tos nen Pavallel Edgea axe called adiacent if are Wkidenk on 9 Grmmen y Nevex- [fro gooue gure edge ezand ey are adjacent Edge ) * Adjacent Verticea: Two \exticen one cabled adjacent if there ae 1A an edge “Jenin them, [From aboue tigers, Ver ler, V4 and\is are cabtes| Adjacwmt Vertacen bat Vu and V2 are nol Nev bear] adjacent * Order of the G™Ph: The order +; 9 graph G ve equal -to the number 4 Ver Bea io @ TM vo usu aeneled ae ». “s ovder + Graph O° S * Degree of New ten. The degree 4; Q Vertex Vi iD 9 Groph G ve equal to the number ay edgeo whch e are Medewr on Vi, with acl, wo Vepr counted Wie. Fro abour figare we Naug CD dq Wea, dheg (vs) =4, dey (Ya) = 3, dey ssl = | * Manimpum and MUrnimunm degree ‘Wn 4 grap: Tha geaph Gwe) where Vz 121,22, @p-- Cir} e wa fine Ber af ver Rete , we shall ure the symbole: 8CG) = minimum Jdegree Wil: wev ft and Q(Q@) = Maxim Adegree (vi) Vie VS Crampie: From abous \y ure &(G@)=1 and AG)=4 * Regular Graphs A graph G im ahich all verbo ave oh, equal dlegree 12 cabled aveguler graph - 9% A + Dasodaled Vester Cond Verkend: A vertex + degree ZEW Ve cabled an trolete ooQakd verkx or an end Nevten. THA Vester hay nd inddant edge. Ny My eV Na Na Veviex Vy 1a caSecl jrolatec| vestx beocauac degree + Vu la Zev « Pendant Vern: A Vert of, degree one ia caller a Perdant verter. From above }qere Vu a Pewdant Vewlex became oleqree $ Vs ia one. * Null Graph: A graph have nn edge io cabled o nu graph Pry a nu graph -each veoten in an idollated Vertex. Theorenn.) : The Aum ay the degrecd +, a Verhea in Q graph 2 equal to hice te vumlary 4: edgea . Prof? Let Giz (we) be 4 graph and Let number dh edger WG be ie. ovdes ae E=e, then we prove thal 3S deqivy=2¢€ Ve Wwe are aa prove theavern % Anduclien or the Yum bor + edege edger fplasing akpa: Step..: Th number + edqus Ww G Ww zero ig. there no edges in G. te. 5 C=6 = deqiv)=d vev S_ deg W) = 2xe = 2x00 vev heorers We true. len dha core. Skep2: oh 2=1 ie. there w oy ome edge wm G. fh thin Case the graph @ haa my 4wo verhan and the degree, 4 e6ch Vern 1a ome. S degw)= lel +222*)22e vey 6 oe F Oe. an ev 4 Tere bere theorems Vo true in tha cane, SEP3: Now amnume that therrern io true for en an | Let © be @ quaph havieg e edge - Delele one edge. meer (aye G Thun a new graph G’, Sey . iA abtained ovina e-1 sAgyc wh eve Gs G- 2 des) a wit S deg —O vey eV, Ve Since each verter UCVe in 4. Rum degree, therebore = 4 eg cv) wan ever Number 2k Say. VE Alao = degivis2e which ia an even number vey ‘ where 2 12 He number + edger in E. Hen tren equoben (1), we hase 2e@ = We + 2 dev) VN > Z dew) = Qe- 2k = even numbe Vee = 2(e-le) Rut each dea (), VEV. 12 am odd number, therebore to make Hu Bum FS degiv) co ver numer , ther ve toma in dhe Bum mut be even: Henw tHe numbey of Verkaa in Ve ia even ie. Hae womber + ver hua +, odd degree ig alway» i even.

You might also like