0 ratings 0% found this document useful (0 votes) 20 views 10 pages Graph Theory
The document discusses various concepts in graph theory, including the degree of vertices, handshaking theorem, bipartite graphs, and planar graphs. It also introduces Euler's formula for planar graphs and provides proofs related to these concepts. Additionally, it covers the definitions and properties of adjacent vertices and isomorphism in graphs.
AI-enhanced title and description
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
Go to previous items Go to next items
Save GRAPH THEORY For Later HA EEEeeeea eee eee
. pNITA. GRAPH THEORY.
Z BUI 2083.
Seaph ? :
(Je po.
g geoph 4 an ie paary (VE) ending @ nen-
empty Aut of vertesV, and a s0t of ectgos E
am a
w v a
wv 1
b
Cc
pegree_OF G vertex:
4 ——_—_—_———
degree ofa vertex wu depined as the number of
sige meiclont te it
a Bimne degree of vertex
deg(a) = 2
sab) 230 i
ta(c) = t
8 deglel) = Bing3 eedegendrl2 h
& edges dogie) = tt 5
6X22 12 deg (F) lg state & privat :
theorem * HAND = SHAKING FHEOREM - Handxhang whe
Tho sum of dagrtees ©h Qtr ine vescticer we twice the
ne ef ectger.
| ue- =o (v) = ae:
Aum 9} reer AB tha Sum of ogress of all Bre
vertices 8 equal te axe
eonem,: prove inet ‘in a graph Mire odd chogrcee,
Vethill pe even NULNVelr®.
finoot: let G be a graph wuh vertex sot V
Lk V, ee the odd degree Voetecer, Vp be tre even degree
vous, V= Vit Veo
We know pom Handuhaxing thoorcem ,
Z dog (v) are. ea (T).
dev :
-—----
ie
ull twee OO
= dey (V)= = We jj eae @
vev a VEV, ete :
§ panda I par IL
Y an equectien ) RUS U even
ae > WS mutt ke even. _
‘
> TL y)\u sum of even do
i dn ws part 1 [209° Jia 1 ee
my 20 tt U ea even
* Sotho part I US (W)| mut be aenr-
$B Ste pout ok os 409)
at even reven = even yoo
+ But each vertex u past T as of odd oa
bz So, three should ke even NUMber Of dager vertices
d= Tyres oF Greras.
Ye O complete Gnaph.
\|; 4 with “n’ vertices "Ua" danoted
nO ushuch “thaste, eairk an e hotw
cs oink outed Age een Buen P
vi
ea ae Kye Ss eye
FS a ait dyno rm py Pu, Speer itt
yin of Oe
and ane Luwe TOPht then ¢
ah mat contains au He t ge q NUG. ue
. Ga c 1 Vewticey 4 Lath,
Tals Mares
a
-
Gi ond G, with ne Common edger ase said ty
emords tp each other Ud GUG, U a wmplote
e ts compl P
graph 4
ct ae “h
4
pause i eas
Figgrtiate cy |
A graph G as zard to bo bi-paetiate y the \ i
voder sot xn bo pourtitienod “ute Swe disjant wubiets S|
Vi, and Ve ftcy= t
fw de > $y
ab arte adjacent “2 ante alio adjacent
be > zt
c4 7 ty
da 7 ie que ;
Sho nce sAQrtYp conclutwens gOe pomenphsp oh tue |
yop
@) Ing ‘ne sh verti indout ae rut be au \
to 18 Oh VOLEICS Un Serena 9
(W) Jha no of edges ‘in the yds raph must be equal *
te no! Of edger ‘in tne seronal graph: :
(HW) No of vertices having zome tn tho qoot 4
graph mut bo AQuatto ne of Varbcer ACU 20m
degee UD the aed ee , \
eG cA !
vertea = 5 vertkey = 5
ectge = 5 oclge &&
vortten with ug eo FF VUUeA With dog l= | |
So, ore 2 graphs are not womenphic. | Tee te ee
Q5 11-8093
PLANNER GRAPH. Fee
Agraph G wu said +e ke Plannos ub UL CaN bo SLeprore gs
N'A plane svithout edge inkersactron
|
4 a
.
.
‘ c
. a planner G. plannon reprietentation
x
EULERS FORMULA (Shortt &)
—_—_———__ Pe
let G be O plannon graph wain'e’ edcaer. vy vescticey,
Let +ho Planner representation ofthe qfeaph divide,
ths plano ute > nO Of regen thon ,
ged para
ntaaa nt [v-e-via | Bw €utors Foromula
4: Lt G be a plannan graph wath ao verticer
Zorn of degree 3, than to how wegen
doer tre planner senrerntation divide “he plane.
S019, Ge O-Vte T= 30-804
V= 20 Sp, Lora
2 deg(v) =ae TH1R
3(ao)= ae T18:) ANG
60 = ae
e@=30
OlTtde-
|
Wiis malades
é toe: Link] @ i
ie and prove Suuters tor -
Ps a : statement + b Mula, the Bonner gr Oph.
7 tal Gq ke
d
a plannor
yedices : pedal eager and 'y’
pine planner Nepreroation, ef te gr i
cae te of Tegiona, qicaph shlit the
WN, T= V-veQ, :
wor sha priove Hus formeuta constreuckd
syorerontaten } tho graph by scent datng
ges as follows ; -
Aebtiorily pick an ecge to the graph G,-
ad an ee wa ere ues qr
Ada an edge toe a as at Gs ’
50, tho graph Gn can be Cae b adding an.
tage te Gn=\* d 5
Let Gy be the planner rupriesentahion, Of the Oot q
wih In NO of UEGIONs » Cn no of edger and “Vn nO:
H VOU -
We need to prove . ‘
Tre On-Vn td .
Ler Ww priove thin by Method of silane 5
Tine: sh seegions iG) ="
Qi np of edger in Gi= 4
Vii no 6h vesctices main B. |
wT re-Vita
1=l-ara
|
Ise | { | So, the formula holds for n= 1.
Tndtactwe € Hyp omen:
\\ Y Let weastume that tha forunuta hotds 4or goph
iN Gx than
be At Dye Cy Ver &
fe
a
. i
° ex! ne of edger On.
~ BkE MB OF vortices Uh Gy
Theuntive Step?
TH NB BL TH ions “un. Gees
7
be we have te show at foe Gy’
Sho graph Gis can be obtained by adding on edge
a eee
ws Cai
| Ony cage added 2 Gu te eels
Az Gk:
i >
f deans
hy : Gea
gD Tm sre W Gea BAL,
Sys = M0 Oh edger DW Gyr, Ctl
Vcr = M8 Of veseticer wd Gy) 7
By inductive hypothesis ,
TK CK VEtR >
: eee -Ugta \
Vi
aie 2 and ong verter added ty Gy, bo yt Gt
Gx
Gk
no-of meqions W Guyy = TK
Lyx = PO of edlges on Gury = Ctl
ver VOR WS Gytl = vq tl
ty inductive Hy pothesis
Hee Vt e&
mgs ah Yee LAR:
Hy, = (ut!) - (Vert) t&°
Teas? Ont Vurat &
Trl
etnod of TIndurtion ,
4 M Xa.3 7 su a : 6 plonner ase eS
vy
Vs
Vy Ve
