Moduli-a ST he bpasted gscph Pa,9

plaran gPaph.
Planan
guh aund calouniry
Sol::
Planan fuaph
eaesented b atleast
A qiaplh nhich Can be meeb Orly at
ohlck he cages
plane dralwing En
the vesics ii catlsda planar gaph
K2,3
Non Plavan guaph
vlih cemot be supuawted by a plan
A graph meet only at aa
duaslg ln whlch the eogs non
planan gaph. the conplete gaph
Vesticey fa Cadled non 3. PT
plaman gapl.
Proklent
s and So|:
of order
oxder 6
Ii) a graph oo
Sol" )
K< gaph

Redsatng
gaph to planar g3aph
E

not pessible fo
nan p l a tg a p .
4. PT the complete hipated gaph k3.3 4 6.Shouw by dMawg
that
K i , , Ki.A RI,3 Ri,4 and K,4
Sol plone gph plamat gapk
Solh.

KI,3
I3,3
Redautrg to plarar gep

AU theue graphs au plaau goaph.

3 egulase gyaph oo
t not posihle o dowplaa Gaph tor 3,3
0sder 6
5. Suppese thee ae t e houyes acd 3 tlity
ohteh ae such that y ti ty potut So[n A
pÑint each
fofned to eaed howe can e tEnes ofjo7nig
Bsuch hat ho Ges each otht.

Sol:

Us
8. SuppPde theu a
Åose fo each o t
lots i t u posible to fotn each
TRdaoing
- ats n suh a wJ Qy that no
fotning each othr
fossible
 Hs Haundhabtng popety
E dog Ce i) = s(E!
ndautal thesen nt
Fuln's
plaran geapla a bTta n vereces
¢
conneeted
M-n + t g lon in ate ef
M edges has exa etly
So fts plauat.

Eulan's formuta
plauan graph
-ented by a plave wtich the eadgey
met Only at the vecticy sueh a do div¯iles the
at pout called ge
plane fnto a nmber
that bo nday oo
Thu nmben of eogs
deglee hat daglom
the seglon is callhdl

R3

Here loop auo consider ed as dege I, and pudect vebe

dy (e) : g
dsg (f)= 3 fos wnbunded

daglRu) =3 bc3

gusion.

dug (R&) 6
 3. Fos plaua guapk oou bolotw
fwtce
veity
to

dges.
R3

Sot. wT E l s oymule
n-nt2 Sor
where m=6

|s(R) 3
dy(e)= s

Eulen's tosula tor te

2. Verihy

Renee veri fiedl.

()
()
COn neoteot
Flnd the no
degres 9, 2, 3, 3, 3, 4,66, 6 .
egions G.
Sot:: n =9

3 4 >QE|
 IEI:
ver ttee4 4 m * 3000 ecs bé plaat,
IEl1?.
Sol m 3n 6

300 0 30od-6
44
19-4 + 3o00

It not posiAl to be a plauar grapl

5. Let G be a 4 Aeg ula cOnneted planar gaph

hanig 16
So!^..

|n 8
By uing Eules popety

[107
plaua
G is a Connected simple
n 3 yectlcu, msedg'

ad egl ons ufl be

1) m 3
Here s u b s t t t t e

(8reom)
 Duala a plauar gpaph
Conyide4 a Conneeted plana graph Gaual a
plane dsauiny.
im tis drawing
Suprese ,T1, 2, 3, etc
molw 'onstuct a graph G* clng
e
V3
beloa
he Psocediure grven
point iside eaeh of the Teglbn R3
by
, 12, 3 etc. Denote tis poiat ' e s e

e6
Vit, V,, v,. te typalively
Re

ef joinng ths poin

and fnteweot he ekacty once
conm mon cdye ek ehactly
there s MONe thau ene edge
3) 76
folouw iug plauan gra
edge ep inteedtiy 1. Contruct the duals of the
VË* and V;* for each common
ep exactty Once
4) Fo an edge e;
lie internaly fn one yeglon
drauw a toop e* at e point e;*
day i.
dor
totersecting ei exactty
Wi are VescCey Qud e* ae ealges COuj
which
callid geonetri dual or dal of G Sot
 with a singl eage Conplete
qaph oo cader 4, do id H

Sol^
posstble

Q planan g3aph.
elemintay sudutn p
I. Caey out tha
for he follousing graph
Detestion of Plamaity Elmentasy Pdutin
Steps
Dgiven graph G dettrninw the st
O
cohich has etae
evey pain of Soln:.
Veten in common
(such subyrapt
-ty ont
aso called blocks )
seubgrgls
a) Pemove all loops from all he
)Remove all but oneedge blw weny pain q
multijale egs
Vertices folnd AY
all vettes of. degree 2 by mengig
4)Elênate
incidt On hese vertces
ntil eaed
Aepeatedy
5) lepat he stp 33 4 4 Hat
new gph aud
Hi twich wil be one ofMe Hi
s denote t Q
 . cheet the plaunty 4 the faloog graph Step 3!
bu he method of elenendany acductt

he
gtven
aph is n0n- plar
Threfese
kure anly
here st 93apk ipen
But
Soh Step split the graph ito subgospk -har where
n0t a planar gaph.

Giaph coloriong.
Number, X (h)
Loop CA omatic glred to coloer he
Step a:. Remave colours
Mintmun no of

muttlple edyey
Step3Remove

romplete goaph, ,
Chsomatie poynoniad
(A -n+1), d>n
P(G,A)> ACK -
er tex has dagee 2. PCG,A) a gph Gie
Merge edye cohieh chromatie polynonial
coleurtng
The
tte
Jupetet
number f colo rs.
Note Problw sha
groph
Acn, PCKgA)=0 1. Flnd
below.
a) ha PKn.)=l

Lotourtg

So|:
3 colo urs we Can
not ajalent
Lre
lere
colour
y
Product rule coloure for e
One

chomate
&. ST
P(asd) ~aph
B
P(Gyd)
Recopositio n theore m
cOnnectd-graph aude a , b )
d)+PGe') 'hedrawfug the above qaph
edge in G thu P(Ge , )= PCG Se"; yes, by
polyngnlal. tor the gaph
3- Find the chô matie cuoatie
sho wn n tgeure
uumber.
Ge (a-b)

8o\^;.
 Chnomatti no

no need f y colourg

4. Ftrd he chomattc polynonial, 4ehomaic 3

the KI.n (( u is conplete btpaschy P(K9, 3), ) - da-)
oy a b> aiferst
Sol, oB Ka.3J- A(4-)(4-)

ditó
Saut

tor
hrometi no =2 chromati
oynomial
what
P(K.n)A) = CA-ty 6. Cy of length H
Cy cle embe.
chrsmatie
S. (ons ider tu lgraph K(e,3)
let dA denotes the na colous awalabk to Saj:.
Grapt
paoperty colour he 'gtven

colourly of the graph

) How many popr
bowe vertas A,B colouresd dame
Stepl
the gaçh
(i) How many propr colourtng
ditberenty.
hawe ver tics A,B colocrd
iii) Thu ehomatie polynonmial of he groph
V
Stepa
 Theorenn i
Multipl cotibn

grqph GG has subguaph G and G9,

T{ a
such that GUGa = G aud
Vy=y

pasive Tutg n
AOMe
PCGiA)- P(G2. A)
P(G,) =
Pttrty tft)
to Deeompositon
theore Bablewy
9 le
the uttiplicatioy theo tm ftnd the chu onn
P(Ge,A) P(ao)+ P(Ge'.d) fc polynomial tor he Gagh. shou in dig.
-atic many way
are
a a i lable n how
colowy
P(G.A) = P(Ge , ) -PCaes) anthe
vertice fhis graph e properly colour

VG

-1
P CGe) =d(a
3 colourns are
(d-)(d-2)
2 P(ae', A) = d reutre)
9
Sol^. .

Vs Vg
=4(4-|-34+34)- A(424 d+2) V3

4lc to Mulapl't at 'on

tth e o e m

r(G,)-41363d
P(G,)- P(Gr.d)- P(G 3.)
(a-b) a' b 3a'b +3a62 J P(kyd). P(ksd)
 V9

V3
d-sa-a 4-3)
Ve

Ge'
5l4) (3)' (3)

360 -P(i4,4). P(Hy') -P(Ge

,4)

graph cam be
be prepuly coloured in
ln 26o
CH-)(4-)(4 -3) -
ways d.d-0(4-)(4 -). d
2. le the decomputtton haorem o fnd chra
-tie polyno mial for e graph shousn 'in fg
Vs Va

Sof"

V3
 Min c u t

Mon-ct Theoven X
Max- Flow aua
Thu theorem he at poslble flow Blw Vectia
a toaspt hetwork
A B tdet
copaities sf ale in cut
nntmum of the
the

be locs. Detun
Johe hetwort sho by ideutyi
low poss tble blw the ve
mat ow
Cutet et & mlntnum Capacity
Soure

6lo Blocwed

ig
Bloctel)
s/ o5o Bloctec!
Bocted

Bloct
Maxflow.
Path Plow Flow
Path

Ps
3 A C’B-2

I4 anFlow
|Max
Minut

14uinct
 3. d tte marimum ouw fom
tn netwoTk shouon (n Aige.
a p3 Hi-fest4,e6}
2o/alslalo M2 ze2, t3, esj
do
Glo
ishl3
Sel. shown fn tig doy
Poth
A. PT the bipastedd graph brom pi to pa.
Flow ave complote nateling
ust bawe

6
6

4 guw Gi,g2 , h3,

Gy
Boys B Ba, B3 4 4
Bz
3
39
?) Bi a
Matching
a bpasded gsaph G GluWa, E) wkere
ey a
Consider fi) B is f the boy
are he pantíH ons oY _blpat o ver ten sct Sot l a we
One

edge set oo o Ih is qph tho

buery eadge has bne set caups.
A Suh et M od E U Coll ed Sol 93

no
eolgy that M hos
bedongs sto
Jestex in os Vg. A matching Min
called a compluts matchung Boom V, to va Bi
in
vertex fn V an
wey 3
i to M. B3
that belong
 K Si Si S o l : . Vgi(5>4)
ln tte graph, the
theue
be chseu 1n cy ways
1680
K =2 (8-)4!
Post ble Malchinys
MI AP, BS, cT, baj
M9SAa, BP, cT, DR
M3: fA A, BP, CT,Ds
MU -AP, BS, CT, DR
Ih each Case StS
Complite matchiy erist Ms Aa, 8s, CT, DR
fossihto Set: P = (where S= no petble maichies
)
Set 1: Bi, hi), (Be,6a) (B3.Ga)
Set 2
Sx 4! x 4
Set 3 : (B1, ai), (B9,h) , (B3, G3)
Set y:B1, G), (B2, 44),e3,G2) Also the S complete
9xaph each Coninting
Sets; (BI, G4) (B2, 63), (B3,63) chses he pobabi' ty

telow. eolge
tha btgasted 9raph: shouon
is
3. Congider te yfnttng
complete matchin9

T 4 eadges this graph a cbegen folooig greph

don ot hove
-ndon. wat u te phobabtity
tat they H. ST th
matching from
matehiny trom
Complete
to Ve Complete
found b

a3
B

bs
(a)
(b)
 Fvom (a) boyt
b by ba
complete
9
92 bi
by nepeat4 ba ba b
tching.
ba by
bi
ConywpOnoing talge as it
wth otker b9
aleady pud
compleBe mathing
J3
by
S. ST oUoawing graph das compl ete natciy bs
S(9) si(B)

Sol Br by. byj

M, Al , B2, C3, Ds
Complte matchung th som Vto is psew:t.
ummagee the sie
6. Tá folowing tabtu {b, be, bg. byj
-ndelip blw 4 H gil 9,92, 3 L aud
bs. PT eack gil b ,beby
Ss boys br, ba, b , by,
Co may boy who 4 fred.
E3 b, ta,b3, by
$999. 94 Sb,, be, b3. by
 Jbi, bz b3, by Stla) St(c)

{3:9394
jb, ba, b3, by?

fbi ba, b3, by

posibe couples.
K2 {CiCes C3, C4j
$CI,Ct, C3, C4,cs
M3 g, by 92 bË, 93b, 94bs
{ag.a3 CI, C9, Cu,Cs }
Mal9,bs , 92 bi , 93b2 gy by
Y 3 Ci. C2, C3, C4, (s
+. 5 igens C,C2, (3, Cy, Cs ane membey
? asso ciatt ns
Pesible ratckings
a member of
a

member of a, ad Q

member of ag end aa
M3
a menber f a3
Comnitiee
Possi ble to fosm a.
PT It is poulhe to dosm Aat each
lway that eact comitte
dvawn 1
membe is drawn somn t as40ciatton. menbey

COm mitte
Sal
ayociation