OMT decaliocj dison fe values

toctdi honal mathemaHCs dealing DATE

coitD ConHoous Values

DISCRETE MeTHEAT1CS AND DRAPH THEORY

A

discete mathe mcHfcs is the study

of matbematiCaL SATUCHUTe h a t c a nbe
CoDSidexeci as discrete ratb ex than
ContiouOUS

The
The Set of objeciS in_ciscYete matde-
oaHCS has COuntable cobjecis Cohtch oe
can diStinguish from each other
It is tbe branch of matbematiCS obich
Jeals Loitb COuntable Sets

Ppliçation piscsete nmgthematis

aDsansEeT YOM place to other
0gistics +2+3.
3
3

uSe
use ot discreie math D logistics
ogistiC is stucy Of_organizinq the e lOL)
Of iDforManiOn ar goods and
sefViCes

- A graph A Subfield
of_d&cYee mathema-
HCS along o solve compler logistic.al
problemS oith the help of ascOph_
 DAT
encrypHon 8 DATE

CYuptoguphy 0etoor k secuYLY fietd

to deterOiDe he
Yaph belp SecuYty of iOfosmatiOn-
bestTOUtes O sDippLOg Or Solvipo
Ohey (ogisica l problems MaOy CrUpto grapby algortbms are

des.iq ec oiththe Delp Of VOÍOUS

LO o hat can be of difffYeDt hupe 0ethds avallablLe i0 deccyele
2TO elaional dta base mODAqeM- mathe MaticsS
CROBMS 3oft are
e System
We aso he Opplicottons Of
found
ddta s Stored in compuer in. dliscrete ma themaics i 0 compute
digitaL Omb DetuooYKS, operaidg sufmg and
algorithms tosho
Stafe
re laonal data ba Sec_play aPott io
almost everyorgani2ation , thot Keeps
Of employs ClieDts OY UniE=S
esouYCeS
(ORAPHS
6 relnonaL dlate base SHODe a piece-
O 10fetmaion i the foYm Ot
e lOtion/+eble orapbs D ft \S a qmPDLCQL_TepreseDtaion
er O data base Co0aioing Stuaen Loith Set of verhces NS a0d
i0fosmation, he coDCept of- ecdaer e) or DOD-empty Set
discxeR Matbematcs Called as of VerhCes a n d edgesS
Ge_ Ollois t o qroup the Stude
ogeher ano put bem insome
Verices/NO d e / p o i o t
Edge arc line
3CTyptogsapby
CTyptogiepny is the Osea of_ Compuie
Science and engioeering ohich clu
 DA
DATE

Va V oneYe-
V s DoD empty Set of VeYicec OY
er vertex aDd a
E is DoD-emphy Set of edges

every_edge 10 the graph bas uexy ge ejj is asSociated wih

end Vericer terminas palr O É verices CVi Vj).Tbe uerices
yi aod Vj Ore called as end Uernices

V is et O4 VerticeS V=LVA Vz, vas_

is SetO edges Fioie Corapb
There is_oDe ecle iD gnapb obich Finite2 Qaph s tbe ga ph ioobich
ConneCH VA_agd V2 DoD- E0Mphy Sets_ot Vertjces
e VA , Vz) and DOD-epty SEets Of
i e edae e1 Das eDd ye yticec V eclges CIre fDÍtE
aOd V
LOfiOHe qsapb fhe graph iO obich
Simílody, V , V3) non-e MptySets OE Vertles
e V3 V1) add noD - -<M p h y sets of

e clges_are 0fioite

Collecton otE Sioply a

Ponis Called LOop/GelEoop
CS Vetices and Co Ilecion
Of ines Loop 1S aecge tobose end veyficees
Called as edges
CAYe Same e4(Vi 9 V).
foxroally, 0e
COD e V

CV, e)define qrapb G N

DeyVi,V)_ e e
 OATE DATE

Vi Vi_oe aDd Mulhple qaphs

1 the end Vertices Simple
eclge ej are same LVj= V)
nrCpb obich don't
Hhen edae e i i S Sald O be Loop Simple oph
have Qny 0 0 p
or_self loop. Called
muHple edges ís
Simple gapD
Mulhple eclges/parellel edges Graphbaving loop oX
Mulhple graph
Sudo graipn MulHp le edges is Callea
Lonen tLO0o CNre eoges bave as muliple_gYCiph. Y
same ericeS then heyOre (alled Sudo QrapD
as muhple edges
e

e V4, Va) AdiaceDCu g0d Dcicdence

Adjacency
VA O0d V2 C g1aph6
T o Vertices eCLch ofber
be adfacent to
are satd to same edge.
Here,e es Ore MUIHOle eclg f tbey axe_end
verticeS f
V

Hbere Ore MOre than one edge es e

Leij andEij_ atsociate uoitb Hhe
givenPair Of Veini ces, CVi Vi FhEn V
hese edger CXe Called _csoulhpl-
ledges
ie e 0 d fi are oultiple edg V , VB) adjacent

es V , Va). verticeS
e V3 Vz)
,
 Non-adiacent verhices (&y VL) dCV2) = degree of ven ter Ua
V V)

IDCideoce s
Verter Vi s e n d Vertey Of an d (Vi) 3
edge ei (Vi, Vj), Hen he edge d Cv) = u
Cuid O be incideDE oD Vi
i SS
Similarly, ei/ s Said to be i0cidept oCVu)=1
d (Vs) =O
an V
V Va dgYfeio pdegrre
eincident_ on a0d Pepdant Vertey
iocide 0t_ OD_ V 4_V3 *SlAted VeHer
eiOCide0t oD V2
eu iocident On V Verte t_oitb leqree f
-es i0cidedF on V V3 Solated vexHer
EfHe is (a|led
solaed Vexter
er_V
Degree of Vexters
cleqree "i
TOtOJDUMber 0f e iOCideDt oD PendaOF verfI: A veytex oitb
Called CS Peodadt
Verterl) is called cegree Of vesterlu Vertex
e x VL

e N Degree o yerker_(ya) t n aboVe gapn

d CV) e

the Dumbey_Of edges incident on

Ve e r i) cdth some loop COuntd
tuoiCeiS CaiIed degrte Of Vert¬(D-
 -DAT DATE D

Set of edge e aYCS

DiTected oapb Diqaph) *Smpe direCed gT9p

direct ed graph D_clo Oot bve
any loop u i i p e CIC haan that
A direcied qapb o Y digrapb O) is gropb i S Called as SiMple dire Cied armpb
an OYd er pair CV, e cobeTe
V_is Do0-empts set OE ele mept
ocidence i0 Qigapp
Called as Vertices ,
batb vertices e V
is he set of_directec edaer IO u0directed araph, edae is incident on
V Io direched gaeh edge is ioctdelht_On 00ly oDe Veytice
e due o AeC ion C2 is inc/deni
V V UerteY
0ot U
e 0-CVe
bo De TepreseDt direCtfd grtiph e ui Vi)
rechion
from V4 to V2 e be CIOy Vorte_oiO he dlqyaqb
e (vAV)
e=CUL Va) tovon3 D=V,P)_
ADd_arc a iD D 1s Sala o be i0cideDt
i o t o VOte U if i i S o he f o r m
a'= CVs U) brtona+o Y-

This are odt MuHple aYS- or_soMe EV

becadie direchon is not Sam
Siiarlu Qrc a is said io be 1OCLdeNt

veries V V are Cop0ected- Out OE he Veyte S o4he

by moYe thOD ODe arC IOih he ofm a U V
Some direchioD, Sucb aYC Ore called
as mulhpe OTCS ndegre Ond OUHdeqree

INdeqre
es gre n 0 t muldple arCS
eveD hough they hove saoe eDd he number OFadees
VeYtice Ocider 10 Nerie V_i llec s
IndegY VeY HX V DDd dS e 001ed
by dc
 DAT -I

similaTLy be outdegree_ot vertex V *NULL(ocapb Na3

h desOed he Do D arcs hicK
areincicleDt O t O V Odi i dleD0 Hei 1 tbe ecge set At_O0y 9aph _LatN
Dy d (v) Verhces i s aD enopiy Set hea he
araph is KOOLn_a Dul aroph
idenoted_Cu NG2

Va
eu CompLPR

e6 et D be simpe a rapb D uetice

V 1 b e olegiee each yerÁex |is Lo -1),
he he LCamplt
gr
ph
gDeler mine ne Dumbet O VerHceS and i s denoted by_kn
matig raph

eclges elso FiOd IOdeoree and simpta9Taph

Outdegree of each NeTeL qiven

clitecteo mulHgraph
yourdiqraph has mulHole arcs bero
oulhQraph I is Comple e aYaph not a omple ie
a aph becaLe
PTola numb o verhites 4 ONOESigDIe gYapP
U =2
Total_Oumbey OE edges
d Cv) 3
dv dv E 3 d Va) =2 am
d C v3
d_CU cCV CDCL th folloLODa Comple e qrCLph
L dtVu)
 DATE DATE n

19--2
bence
Eveny compie groph isTegulay rapn
but eyery egu for graph is o0t a compleke
raph

bero is xeaulay bu 06
CompleR raph
MQular goph due to degree O
each verex IS 2
but not (omple R Decouseoegeg OL each Ver er S

Complele qraph k o is also equulaar

Gra ph oh_deqree (0-3D

compe R arap bas O0 eckes

2
Bipartite hxaph
-Every COmolee graph_has nCO-1 number CR kno aTaph (
2
of edges vertisS Cet c d yes
k 4= G eelges
Stot

Wheo(n be_a qnah ditb Veiter Se V

*Regular graph - ond edge set E ' heD_ h is Cailed a
Teqior gmph degree af each bipaxfife arapb_i
Some -is veiter_Set V caD be pay htioDed
tuO0 disjoint subset ' V and V2
he degree Ot each Sucb that
Verer s 2
V U V2 V ac
degree Of each verPG_ V D V i (P
- ADd each edge o n ioiots a veyte
e OfE Vey kx 04 V2'
Vettx
 --DATE DATE

VIEtarb f}
VUVL= V
VoVa
ID biportie arapb, he veytices orVas
Should Dot be ioined similaf ly etices a bipa tite gnaph
O V l s o should not be 1oined by
Ony eage

V
PNO1_a bIpOIiR g0ph

N
V
Vu

Va Compl ee Bipayhie graph

A +htee are bipayhte graph A Biparie grapbi Calted a CoOplek
bipa rh e gIaphif_each UeHRX Of V
every Verf SV2
but bipai iH qraph

e V cO
aDLpaxnHe qraph.
So omple bipait graph.
V . p
V {a.b
V Ccl,e
So CompleBe
Bipatie graph

Not Comple ke Diparle

qra ph