0% found this document useful (0 votes)
27 views6 pages

DM Assignment

1. A complete bipartite graph is a bipartite graph where every vertex of the first set is connected to every vertex of the second set. It is denoted by Km,n where m and n are the numbers of vertices in each part. 2. An example of a complete bipartite graph is K3,4 which has 3 vertices in one part and 4 vertices in the other part with every possible edge between the two parts. 3. Euler's formula relates the number of vertices, edges, and regions of a planar graph. For a planar graph it is V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the

Uploaded by

santoshkuruventi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views6 pages

DM Assignment

1. A complete bipartite graph is a bipartite graph where every vertex of the first set is connected to every vertex of the second set. It is denoted by Km,n where m and n are the numbers of vertices in each part. 2. An example of a complete bipartite graph is K3,4 which has 3 vertices in one part and 4 vertices in the other part with every possible edge between the two parts. 3. Euler's formula relates the number of vertices, edges, and regions of a planar graph. For a planar graph it is V - E + F = 2, where V is the number of vertices, E is the number of edges, and F is the

Uploaded by

santoshkuruventi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

age

Complele
TO
vent
is
m ices
ài all @) graph Clax Name
eg:
mpere Camplede Defne
dpaminq
of denoled
Fm,n' by Compek :
Compae cst
are n M
mben fg the bipatite the CAIML) Podquma
ohích biparétte
g'gphi
ad edgesgeph: bportite follaoing -B
of focent evoy
qraphs A Poi
ver A Signen
t ces fo A vatex tams handi
complde that :
Sabqroph ot t a
al of A oith -5
moy
the usit ekshva Compl
Meke
be s Jullablk
xampla
vortes an
is bepre fatentad
uire bipautite
Dt Suh to
1s
9raph the ced
that evey qroph Koll DiCubjsorelect e :
dero feaibo
vaveit
edqe. g1oph no'
ted THI IM| vertex
ohere 227ZIA
by that c of
is
m Malhemara
k al and N. o
Bipe 6
6
ohere polfencs bihe
putile 8J
the N
n
Qtateand
has
Proof:for erterior
ficesYcogi
vawhueonj pane æ) degrer Regul
qrgh b )
N-Yeqjon l Eulers
M-
=
(N-)+2I
+[
El
e l- 2 as dumbe
Same
Cyde
a
'aistheoren? form
2/2
a
|= ggph:
2 a
tree, plqaphone - prove
A
connesld cy 4
de
if
N' 12)no
is Of o gle
Eule
is
aluconlay neighlovrs
plonar tlurem engh aph
noo hnrm

veutces regions, qrayhr icr , n. onleof


fm y i's a Cycle
each
edges
lEl 1Rl hen andihatiny graphs n
i veetex qraph ss
no lel any ae a
Nl, heoem
drawhg
(vl - hay ohae
tqín- -2 denoConneckd
veqions, the eoch ted
of same graph
vorber by
iltlig 6in
Chcohoie
t/ the
ArTwo- 3

discoxetng u)-Handshake
non-
f: isomorphitm
Define grph fodirecednon ggom
vutices
no- If dere by
for each (vl (vl+1 (vl-(E) 2
+(2=adding
) vCa) cte
f gven d -
is
qraphs fsomerphím -(e)4 (1El neo
ontD ’V(6) dsgree qraph 4) edge
a connot evn a theoren formuloy
Euler'y24 Rl
omC fo +(2l:
and Stomorphi
and m tec iI
dfreced
9raph
palr from tices
Ddd ve
sequence 2 2.
G'ae dyauonbe thino
of When +
vetcesof
the an
.Eyplainoith 3vopha
íromorphícexample V=UUn
even vfoalaty (i,
vett 5 dg
ces
3, thun (u;)
ohat numbu 3,
of
3,
f the s, 2l6)
G re L/6)
to 4 is
thoe the corollay dq
vetes the
steps veaties (i)
fsa
of t eatex
G tol co that
Soch locoe
fanckfon odd in set
hd d
()
tn degrey. any of
lel a
t'ceyvu
no
ontois4 Cb)>b
flfa) sa Ropetes
fCe)=el flo c
ane

and
Satisfid 5
2133,C,)
Dne
1 5
oneto

5
Graph- G

Ye
SotisJefred?
dhauo rnu eat cdentil cycle d have
of a har cutvde
alo tonian edgeatltraph exots ay qraph doenot
.evtmplea to thu
eslmples
flars each tere referaed
mu The oond degee,
not includes 1f . as
tho Rrh vetice
tonianis dod
bot of rons
ohrch
,
graphs
tamtlbnion
and Eulerian thot cacle four f
verer whwe ltami
tices
mulir'
ais aph eoch path
on
(>D4
B
A ve
) be Soch
to has
G.
coing tnkrsecks
Cule
cafd d
follo complek
he
vater Since
the padh and fs
drutt clrutt
Eulafanof evaycycle
tlamfltoncan
A onle Cireuft
Fuler dlaqram
qeph
Eulerian
s: dls
hsrap Contatnfng (ts Hamilton Euleriam
ian
congda
eva
Explain Eale
above
the
paph (i). ()
A a
Defne
Chro 5)S
.
fg X
qraphbnoen Hinfmum
ayChromat
number:e
(a)
a)
Chvomatte
colorno. maBrc

num number ofa


be chro
matr
c() a 1quhred
c
nombe.
br
fosd for a
ît frplan
7raph propc
ir cample
coth it
represen
tedby
a coloning
loorsCo

You might also like