Grraph Theont

A G ordened
an
tipla (VCG), E(G), $)
Consists e a nen-empty &er. V callad the set e
ventice tea a p G , E saicd to be te Set
ege e
gaph G ad o s a. mappín em
t &e .
edaes E to a set o ovdlered corm unovdeAe
paws elemeni V a

Eg L G =(V,E,) wheu V
Vi, , V3 an
E-et, ez, ea. e es j and &
dofined by
( ){ ve3, ¢(e) , -
s , dtes)-{va,v»3

es
 e
Va u V

The edqes a drawn sthaight o

Cw edd
tona or shot. Tha impotant point is
how he, eicu ana joined up.

ovde siza a gnaph:

Ovder
The ng elements in tRe" 'eitRRer is cast
G.

Siz garh
ThA n elemens in h e e g e ek acalled
the size G.

Noto

The vertics. t qhap comepend to dots o

gmal cincle and each edge comeap-ends to a

Line joining te ventices.

AdjacRnr ueice

An pais o enticis connectec

ae catlad
e s tn a ghaph
adjacent ehtcRs.

Here, Vi, i Va V Va,V

ane adjacen enices. Va
 V .V y a s not adjacen ueices
Undinaebd ghaph
A apt n uh
ewy edae u ndictnd
Adjacent d callad undikeead gheph.
2 diatinct edge a incidant uith a common

ee tfen tay e caued adjacen edges.

a
e au adjanan -o4-1
edges (eom mon veute-). Mined ph:

It sema edges ane dinected Some ans

IsolatadAkex: undinected in a graph , then the naplh u a mine

m any aaph, a wetex uioh à not aaljiaco raph.
o M a extex callad an údatut ere.
Loop
Here k a s ho A Loop an eae hose uentics ahe epal
Incident etgai Tha edge haue same nihas & tesminas

Nu aph (m Thivial ghaph:

Paatla edgu cg muplu edges

dgs having he Same pain
ictd ph
A a p t n whic euany edge t dinectd 'catd

a diead ndigaph.

Scanned by CamScan
 Muti p Degne a ventex

Any hapk whies conkains Aome I egu (v, ¬) bea pah.

The ng «dges of 6ineidont witn a veter veV
called dagu o V it i danotad by
4V) um degtv).

Phaa gnaph 6 (V, 6), uwtou ve11,3,4,5

andE&2).1,4).(a,3), (a,4), (2,9, (o,9).
(.3

A naph in ucek egA's a a aMigne o e y

edge à cate ghted Apk.
o vedeu ot
odd dagra-
* n?
I n any ph,
(o-
A vetex degnee callad a Pendant
.
end ventex in
isolated
u ealad an
OA vetex o dera
Mulipla vente n G.
6N T9pe Edges edge
V.
No Gach Loop s
Counted tia o dagaa
Simple 9haph Undinected|
Mutti . a % , Undisetad e No
ae Ae dagres o h a
vertices in ma
what
E9: aph GG ?
No NO
Simple ducted qaph | Dieted dtu)2

dt)=
Diet
Miedgap% Undiseared i eg:
d ) 2

Ye Yes
5. Pcemdo apt Undiach4
ds) 3
 andahaking Theorem Jn-daghes Out-dagr.aa :

*Satemenefo ay 9ap
with E ges Ina diascted aph, ha ng edgas withV
2E. o thein minas verex is callad
VveniCe
d (V)
= tA in-dagas
Ir danoted y
deg (v)
Proof In a diacted gaplh. tae
hai
n esqu r V
kor GG(% 6) be any
gnapl. a iniuas vete catled our. dagha
Since eack ege contibutes uicA ai a dngr fr
dso ted dag (v).
he Sum e dagheas a a l nicea G

ice a he ne o egas in No
That d(Vi) 2.
The 6un of deghaa 4
s called the total
out-dagn ea ventex
dognas the
f venrex .

The ne e odd deghae etiCes a

aluoaue even. A Venkex
wiet To
n-dagrae u cauad a sounee.
venkex t zeo
out-dagAa is caulad sink.
be e ventices td
aven daghe .
V e Re vertices o Special Stmple Gnapt
WKT
(a) Comata Gaph

A
Mmpa nape n uich e is
vacty ona
ed betugn encA
pain o dhnct uetices
cated o
cmplasta qaph
Since each of d(v;) even, and eac d()
odd Tha Cemplata ape ' eeicas u danstad

dv) eucn g dvj) eh

Sum o odd no u en

Ihe. ng; teume n LHS sum must be even

2
A 3

Heren edat daghe veticRA ú

awa euen.
 1, *e . N e in a 44m Aujn
wentici a. -agla gopk
y Canatshaking ,

Bi-patiu aph and

cemptauy bipaaita yapk
:

3 ee* V a timple haph G» v, E

be panidmad no a su-sats V and
d() d ) devs)+... + d(n) ae-OD muah u a t , a u e y edge cemracts a

Suoe RT AA n a
a can ba n-. callada s-pardte qaph .
nte 6 V by an an G cat
Cn)+ . . t o n tauni n-1) 2 cempleby bipnita qa& and danstad by
Kmn
n{ni) -'ae
en-9 i-patite g',apa

B
egutas GraA Cemplutsy bi- padtt a p
e u y erax o a sinpla a a has *a sama
At
dagnas, ter Ae
qrapa iu alld a
hegula 9aPph. Ka
4 eae eex i a
hegula hap& has a
dagea
tRa hap à caltad n-egulas h

ADO) 2-egulan
(since enca edge
go
Lpnyects 2 vetce
Connectedness n unduhacad gaahs Sapanhg on both Ridos,
An uniotd haph u said to be Connectadi a
pathbehuan eey pain o diitinet vektcu o

(n-)0a1)4... +(nk-1)J n* k* 2nk

itj
A a p a tha is not ceueclud i calted (ni-t)* s *+k-2nk
ctiscenms cad
G

Note
diacewnaetad aA e
-n t' znk
ameCo unio
ted
wick &a ho, Cornne ur agds Each
ex Theedajom +knkran
Cemzed kus qap, a a
callad e eennead
Cenp onen a gaph. n +K-2nk + 2 n - k
Now, Ae max. nf e a e in e iM compran
The maxirum ne dges in a sinpte diuconnecta
w APh. 6 i h n uetices and k componek

n-) (nk+
Max. np eags =
nini-
lor the ng of ventices in the
i compnet s
be n (n1), hen n nat. . +hk n (o
-
Henca, En-1 n-k

h+ank+2n- K

Scanned by CamScanne
 Connectedness in ndiiucad ghaphs

Anundichd ghaph u said to be Conneclac ia

distinet venttces
pasbehuueen evey pain

(n-1)'+ ag
irj
(ng)n-) * * ank
A hapt Hat iu not counecud called
Z (m-)* s *+k*-ank
discenn eed.

No A
discewnactad aA khe unio
e conacted sur ghapts. Eac pa +k s n k=2nk
wich a ho, Cormnn lex The djom an
Comnacted +K*- ank +2n-k
uqaphs ae. call e cene
Cempenens oea ghaph i
No, R max. n? ega in Re comomead

The masimum ne edges in a Simple diconnect

with h etices aud k compenenkh
le P 6
n-)n-k+) Ri(ni-)
esqas 6
Max. np
L o t tha ng of ventices in the i compönit 6
be ni (niz1) , hen ni4 na t.- . +hg = n (o

Hence,
n- n-k +2nk+2n- K2
F

Scanned by CamScanner
 nev a
Thee propeties aw olld an invanant
A
Cemplata y b pankita gaph Km,n isononphic quphs.
any o Kaa condiuans ane not sauugad
Net
in u naphs, hay Cannot be isomophie.
S - 9 . 1

somOphuc apls eramplt

S gap
A Aph H (v. e) a aattad a uugnaph

(V. e). is v'sv e's6.

H
an H caieeda Apanning subgnaph Connectivi ty
*i Gnead Pas cyeles
A spanning sunapk not
cenain al iu edges. (skau conain a t venkices) arernating
pa6 in a gapk a a inite
Path -
A
verttcs ansd dga4 beginaing
b
eAnancR
etucas,
suca
that each dge
endin9
R
veacAPreceang and followug
neidEnt
en
na pah aa duinee, it
i i . E t o e.ges
s c a l l u d a mple pat
Spanning Sughaph
Gnop
v a imple path
Isomonphic aph Since no edge appeas
more than oncaa.

G2 a said to be isomorphic
Turo naphs Gi and
a ento-ome
Vz es V. eV2
if tene exuta V,e, V2 e
otten
to eact
veex 4et whick preleie a path since it conains
e
coeipondence bss
e tunce.
adjacena e vetices.
(simpla or genera)
The
n edga in a p a
Isomohphic aphs kaue Note:
caled the angth a path
vebices
i the same ng

) ta sama ng eges
comespending veniecau with t a sama
dega
i) the

Scanned by CamScanner
Mat ap gnapha

Adjaeney malu Sinc o

mp qNap. a
na lope
Va. . . Vn, s maun A (e AG (aj) D iev iri, 3,
i V; an cdge of A m uc
. tewisa

calsd h djacun mau

wwts adyaceny ains

giaen ap*

wwa adaca

3nedancs naiA
e G be a gph w aces

.oteAwise

ú d incidsu madw

Scanned by CamScanner
 [ - a n k +n- ]
A COnns ctd qNap c o r a s an Cus e r
AC iu vicas kps euer
das
A cemns tud aph cowuns au enlAn path
In-t +), ibas eactty venucas o sdd
dagras.
T Cules pat wuu kave H odd d g
e n i ces as i end points
eulenan and
Hanit tonan Gaphi
Hamitoian patu
Cukesia aM-: A pa
m
gpa G path t
agapk
ncludes each
a caslsd emi tnan
v e r e e G. aack
called Eulenian pa, i} it
netud aa tack
ige %G eacey ence
tena cimcuit an a_rCa'
Acaenit a ap& G caiod Hamitonn
calles Gulenian er 't enetuudas eack vean s G eraP **a
cur,
is it axcept Staung 2 es eucas wuc a
Euleuian gnoe6 ne
t sa ). wies
aFP eas rcs
AgapA cemrainig Eutenian ckr. s caitad Hamondan Gr ap
A gnapC centaiiug Hami ttonian ck. a

c u csneider the graps called a tamitowan gnapk.

G G7

Graph G cembains an euteniaa path b B GD The naph G1 has kaamitowan ckr, nameey
namay B-D-c-B-A -D, sinc 1t inckudes that in his ckr, au
A-B-C-D-A. we ncte
ech a edgs exacy mce. but not
vedices apPpear (eaeh onc enee)
Goaph Gra Contains
a enlarian ckr.
namaly a th edges.
A-E-CD-¬-B-A, since it inctuda eaeh Tha gep& Ga has hamikonia path namey
ek
t a eana hamittonian
nceacty i an Eulenian Gmph A-B-C - D . but not a

0 it conto.i a Eukenian ckr.

Scanned by CamScanner
 Spann ing bees
h e sub graph T
o a connected Aaph Edges i k mia.
a h centaaining au the v@tices ww weight tnar do
abdy telstted
G, 7han o ioim
T
caled a spanning bee eda a a
c jit
G cceuively odda
9 baan kelactad
I G has
veiau, auy spaming beu o G
w alo have a vetics ana d
edge ey Find in
wing KAumas's algovitm. spannune
"bu kr
VT wgi gaph
Graph 7.V N
Spanning hes
No
Euy emecud
h aph Ras arlear I
obvious whan Ghas 4panning Kee . we first amange Me
i ow no ckr., asG h e esges u adga in h
inuuasing ovdaa
apanning th procaad as per Khwkal's
a4 G haa a He, n
(ne % algomMm
ckr., we can
ek a vetica) 5
daleting an
edae rem ha cx spann ing &e by Max.
edges ncuded » 5-
Miimum Spanning bee
weigh Inctudan e I icudas.
Spann crkma
G a connecbd weightad aph, ta
AG
panning b G with the smattest
tobadeigh
i callad the minimum pann ng yes
thee G
AC
cE A-C-6. bmad)
sal's Alqoritkm
1 BC
e edges tRe giuen haph G ane
rdeu ot incaaking weighs. amaiged n tk BE
DE
etge Gwitm min.
weight
hagthad Apanning baa Aeleckad"a an edgs AD
AD

Scanned by CamScanner
 possibla T
contain a
a pain o vetics ckr.. This
Vi and maon tha
oo o disinct v; b whuch
puhs ex
ut, tw
wich is
Hence T
Cannot haye a
o
cohadicien.
ckt. and
ThenatA un due ctacd aph , as thac
an a be T

tta awGuA Janp le path bw

i

TheR pa o veaices eueny

A Connact2d ghaph wihouk any icuk ü
allad a Oe,
A e has t be a
aimpla graph (no laops Proo 2d prop.
elgea)
B madhermatuCaR inductiom
P(n)A thes uith n vetices
OAn undirctad graph has (n-) esges
a a tee pt1) n thes with
i tfana à ventex has ne ea
sinpla path b
a
uniaa Ous
eueny ain oventics Pe) A a e with vericas has z
edas u tuR
A ith oea
nertaics fas (n- edges.
n
A SSume K) : A bea uwith k etice (<n) has
Any Ceusctnd aph witth. ueniices n (K-1) Ages .
and (n- edgu Lat us idas a the T with n vetiCAs.

Any cincuit
hapa uwith n
venticks and n-)
At ep * Ae ege conecting + vedices Vi

eges and Vj T(by propery)

e u the ony p a ohw vi and j del
Poof of ptp: he eda k bem T T become diconn ectas
Lat e
wdiscfad aph T be and (T-ex) Conssts of exactey 2 Compenens
Then, N
a
tiea
daje a bee T connectrd (wiuk ckr.) whic ane csnectu.
Hence, TRane ú a
simpla pabh betweæn any pai S T ad
T2
Since T did not contnin any ckr Ti T 2 alio
vebice V and Vj
I wt not Aae eincuits.
possible, lut Aane be 2
pabhs bf Vt Vj (ona
e V o vjand otRo
jen Vj to Vi); Combinatitm tlence, roth T and Ta ahe teeseaeh havig
Ress than n veics say r and n-7 taspecie
these 2 pats would contain a chcuit.
Bur, T cannotaue
a ckt (by da8r). Bu inductien amumptiem, T with vestices haa
Hence, ttere u a unique Anpla 1 ) edget, Ta with (n-r) vehtices has (n-T-)
pak bhw eyey
pai ovetices n T. edaes
het a
unique path exut b euey pais a vetic
in T, then T i
hae fove. T has (T-i)+ (n-T-1)+1
n-i =

connecd A with n venticu has (n-1) esge

Scanned by CamScanner
 Find min
y kmkal's algoitm MAn k a l spauni
's
ue jes re
wegTas J
agoni tRn

D
a

5
na6 Max. edges
Edge eigAr
Inclaudad in a
panning ue or not| Ck. tomed
not includos, weigh Spanning bua
4no inelue
or ne C. femad
EF
ec
Ae 2
Yes eF 22
Yes
CD No 23
Yea
CD-B-C ck
3F CD 29 Mes
Ye
CG No
NO D-F-B-D ckr. C6-D-c ek
AB Ye
AB
DE e A-.F-¬-A
DE
No ---e
AE
CF
C-F--c
AF 21 DH
44
EF
45
FG 6a

otd weight = 56

Tota e n h t = 19

Scanned by CamScE
 Use Kakal's
De io ts algoi m o
weigkacs qaph:tind o mun.
spani

Since ece are 5 etica in a haph, e Shus

Stop o Prvccs for whon 4 edges Gaue bean Aelecta na Ma.

Th
edges -8
esges nmin . spanning tree ahe AG, AC,
AE, D Edge Inckudss
2+3 +4 +6 = 15 Tota gth i 5. weighr in te
| I nor includad.
EF
-
Spann ing3 ha onor ck. fema2d
es
HI
AD Yes
BD

EH
Yes
CF
Yes
BC
1es
NOa Tieir ae 5 ote akranatiue mun.
FL
FIAEF teer)
e s g total tengtk 15, whose edges Spanntu
ae isted FH No FHEF (ckr)
eles'. GH Ye
) AE CD, Ac, ec
AB
)AE. CD, Ac, E BE
DG

(3)AE, CD, CE, AB F

DE
(4) AECD, CE. BC
DH
(5) AE. cD, CE, BE

Total eiaht = 22

Scanned by CamScanner