0% found this document useful (0 votes)
23 views20 pages

DM Unit Iv-Mcq

The document contains 17 multiple choice questions about graph theory topics like types of graphs, properties of graphs, and bipartite graphs. The questions ask about concepts like isolated vertices, parallel edges, regular graphs, and the number of vertices and edges in complete and bipartite graphs.

Uploaded by

shravan kumbhar
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)
23 views20 pages

DM Unit Iv-Mcq

The document contains 17 multiple choice questions about graph theory topics like types of graphs, properties of graphs, and bipartite graphs. The questions ask about concepts like isolated vertices, parallel edges, regular graphs, and the number of vertices and edges in complete and bipartite graphs.

Uploaded by

shravan kumbhar
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/ 20

Uni

t4:Gr
aphTheor
y

Q.1 Gr
aphi
scol
l
ect
ionof
(
a)poi
ntsandpl
ane (
b)edgesandv
ert
ex
(c) edgesandwei
ght
s (d)v er
texandpl
ane Ans.:(
b)
Q.2 Anedgeswhoseendvert
icesaresamearecall
ed
(
a)sel
floop (
b)par
all
eledges
(
c) ci
rcui
t (
d)pat
h Ans.:(
a)
Q.3 I
fmorethanoneedgesar
eassoci
atedwi
thapai
rofv
ert
ext
heni
tiscall
ed
(
a)par
all
eledges (
b)sel
floop
(
c) ci
rcui
t (d)simplegr
aph Ans.:(
a)
Q.4 AGr
aphhav i
ngnopar
all
eledgesorsel
floopsar
ecal
l
ed
(
a)I
sol
atedgr
aph (
b)Si
mpl
egr
aph
(
c) Mul
tigr
aph (
d)Regulargraph Ans.:(
b)
Q.5 Agr
aphcontai
ningt
hesel
flooporpar
all
eledgesar
ecal
l
ed
(
a)Si
mpl
egr
aph (
b)Mul
tigr
aph
(c) Regulargr
aph (d)Path Ans.:(
b)
Q.6 Thev er
texwhichi
snotconnectedt
oanyedgesar
ecal
l
ed
(
a)I
sol
atedv
ert
ex (
b)Pendantv
ert
ex
(
c) Adj
acentver
tex (
d)Noneofthese Ans.:(
a)
Q.7 Agr
aphinwhichall
thev
ert
icesar
eofequaldegr
eear
ecal
l
ed
(
a)Regul
argr
aph (
b)Mul
tigr
aph
(c) Si
mplegr
aph (
d)Noneofthese Ans.:(
a)
Q.8 Thetotal
numberofedgesi
nacompl
etegr
aphis.
(
a)n(
n–1) (
b)n/
2
(c) (
n–1) (
d)n( n–1)/2 Ans.:(
d)
Q.9 Themaxi
mum numberofedgesi
nanygr
aphi
s
(
a)n(
n–1) (
b)n/
2
(
c) n(
n–1) /2 (d)(n–1) Ans.:
(c)
Q.10 Agr
aphhav
ingnoedgesar
ecal
l
ed
(
a)I
sol
atedgr
aph (
b)Nul
lgr
aph
(
c) Regul
argr
aph (d)None Ans.:(
b)
Q.11 Aver
texwit
hdegr
eeonei
scal
led

1
Uni
t4:Gr
aphTheor
y

(
a)I
sol
atedv
ert
ex (
b)Pendantv
ert
ex
(
c) Adj
acentv
ertex (
d)Nullgr
aph Ans.:(
b)
Q.12 Asubgr
aphwhichcont
ainsal
lthev
ert
exofagr
aphi
scal
l
ed
(
a)Spanni
ngsubgr
aph (
b)Compl
ementofagr
aph
(c) Subgr
aph (d)Noneofthese Ans.:(
a)
Q.13 Thenumberofver
ti
cesi
nabi
par
ti
tegr
aphKm,ni
s
(
a)m +n (
b)m n
(c) m (
d)n Ans.:(
a)
Q.14 Total
numberofedgesi
nacompl
etebi
par
ti
tegr
aphKm,ni
s
(
a)m +n (
b)m *n
(c) m (
d)n Ans.:(
b)
Q.15 I
fV1isonesetofver
texandV2i
sot
hersetofv
ert
ext
heni
ncaseofbi
par
ti
te
graphV1V2is,
(a)V (b) V1 (c)V2 (d)  Ans.:(
d)
Q.16 I
fV1isonesetofvert
exandV2isot
hersetofv
ert
ext
heni
ncaseofbi
par
ti
te
graphV1V2is
(
a)V (
b) V1 (
c)V2 (
d)  Ans.:(
a)
Q.17 I
fever
yedgeofonesetofv
ertexi
sconnect
edwi
thev
eryv
ert
exofot
herset
ofv
ert
exthent
hegraphi
scall
ed
(
a)Bi
par
ti
tegr
aph (
b)Compl
etebi
par
ti
tegr
aph
(
c) Regul
argr
aph (
d)Compl
etegr
aph Ans.:(
b)
.
Q.18 I
fev eryvert
exofgr
aphi
sadj
acentt
otheal
lot
herr
emai
ningv
ert
exofgr
aph
thenitiscal
led
(
a)Compl
etegr
aph (
b)Regul
argr
aph
(
c) Bi
par
ti
tegraph (d)Noneofthese Ans.:(
a)
Q.19 Maxi
mum degr
eeofav
ert
exi
nasi
mplegraphis
(
a)n (
b)(
n–1)
(c) n/
2 (
d)n( n–1) /2 Ans.:(
b)
Q.20 Howmanynodesar enecessaryt
oconstr
uctagr
aphwi
thexact
ly6edgesin
whicheachnodei
sofdegree2_ ___
__?
(
a) 6 (
b) 8 (
c)4 (d)10 Ans.:(
a)
Q.21 Whati
sthenumberofedgesi
nagr
aphK10.

2
Uni
t4:Gr
aphTheor
y

(
a)40 (
b) 45 (c)50 (
d)48 Ans.:(
b)
Q.22 Whati
sthenumberofedgesi
nagr
aphKm,n(
K5,7)
(a)30 (
b) 32 (
c)35 (
d)40 Ans.:
(c)
Q.23 AnIsomor
phi
cgraphshoul
dhav
e
(
a)equal
numberofv
ert
ices
(
b)equal
numberofedges
(
c) equal
numberofv
ert
iceswi
thagi
vendegr
ee
(
d)Alltheabovethr
ee Ans.:(
d)
Q.24 Whet
herthegraphK6andK3,3ar
eIsomor
phi
cornot?
(
a)Yes (
b)No Ans.:(
b)
Expl
anat
ion:
K6i
sacompl
etegr
aphwi
thn=6
Numberofedges=n(
n–1)
/2 6(
6–1)
/2=15
K3,
3isabi
par
ti
tegr
aphwi
thnumberofv
ert
ex=3+3=6
Butt
henumberofedges=m *n=3+3=9
So,
K6hav
e15edgeswhi
l
eK3,
3hav
e9edges
Sothegi
vengraphisnotisomor
phi
c.
Q.25 Aspanni
ngsubgraphwithequal
degr
eeofal
lthev
ert
icesar
ecal
l
ed
(
a)f
act
orofagr
aph (
b) compl
ementofagr
aph
(
c) v
ert
exdi
sjoi
ntsubgr
aph (
d)edgedi
sjoi
ntsubgr
aph
Ans.:(
a)

3
Uni
t4:Gr
aphTheor
y
Q.26 Themi
nimum numberofedgesi
naconnect
edcy
cli
cgr
aphofnv
ert
icesi
s
(
a)n–1 (
b)n
(c) n+1 (
d)Noneoft
hese Ans.:(
b)
Q.27 Thenumberofdi
sti
nctsi
mpl
egr
aphwit
hupt
o3nodei
s
(
a)15 (
b) 10 (
c)7 (
d)9 Ans.:
(c)
Expl
anat
ion: (
c)
Q.28 I
nanyundir
ect
edgrapht
hesum ofdegr
eeofal
lthenodes
(
a)mustbeev
en (
b)t
wicet
henumberofedges
(c) mustbeodd (
d)neednotev
en Ans.:(
b)
Q.29 Numberofvert
icesofodddegr
eei
nagraphis
(
a)al
way
sev
en (
b)al
way
sodd
(
c) ei
therev
enorodd (
d)200 Ans.:(
a)
Q.30 Maxi
mum degreeofanynodei
nasi
mplegr
aphwi
thnv
ert
icesi
s
(
a)n–1 (b)n ( c)n/2 (d) n–2 Ans.:(
a)
Q.31 Agi
venconnect
edgraphi
sEulergr
aphifandonl
yifal
lver
ti
cesofGareof
(
a)samedegr
ee (
b)ev
endegr
ee
(
c) odddegr
ee (d)dif
fer
entdegr
ee Ans.:(
b)
Q.32 Agr
aphisatreei
fandonl
yifi
tis
(
a)compl
etel
yconnect
ed (
b)mi
nimal
l
yconnect
ed
(
c) cont
ainscir
cui
t (d)i
spl
anar Ans.:(
b)
Q.33 Acompletegraphwit
hnv
ert
icesi
s
(
a)2-
chr
omat
ic (
b)n/
2chr
omat
ic
(c) (
n–1)chromat
ic (
d)n- chromat
ic Ans.:(
d)
Q.34 Thelengt
hofaHamil
tonpat
h(ifexi
sts)inaconnect
edgr
aphofnv
erti
cesis
(
a)n–1 (
b)n
(
c) n+1 (
d)n/ 2 Ans.:(
a)
Q.35 Tisagr
aphwi
thnv
ert
ices.Ti
sconnect
edandhasexact
lyn–1edgest
hen
(
a)Ti
sat
ree
(
b)Tcont
ainsnocy
cle
(
c) Ev
erypai
rofv
ert
icesi
nTi
sconnect
edbyexact
lyonepat
h
(
d)Addi
ti
onofnewedgewi
l
lcr
eat
eacy
cle Ans.:(
a)
Expl
anat
ion: Theor
em

4
Uni
t4:Gr
aphTheor
y
Q.36 Agr
aphcanbedr
awnwi
th4edgeshav
ingv
ert
icesofdegr
ee.
(
a)4,
3,2,
1 (
b)3,
2,1,
0
(c) 4,
5,6,7 (d)3,2,
2,1 Ans.:(
d)
Q.37 Whatwoul dbet
hemi
nimum numberofedgesi
naconnect
edgraphhav
ing
11vert
ices.
(
a)5 (
b) 10 (
c)15 (
d)20 Ans.:(
b)
Q.38 Whi
choft
hestat
ement
sar
efal
se?
(
a)Agr
aphcour
singex
ist
sforagr
aphi
fthegr
aphhasnoi
sol
atedv
ert
ex
(
b)Nomi
nimal
cour
singcancont
ainaci
rcui
t
(
c) AHami
l
tonci
rcui
tisacov
eri
ng
(
d)Aspanni
ngt
reei
scov
eri
ng
(
a)candd (
b)b (
b)aandc (
b)None Ans.:(
d)
Q.39 Mat
chthel
i
st1wi
thl
istI
I
Li
stI Li
stI
I
Hami
l
tonpat
h (
i) Cont
ainsmi
nimal
cov
eri
ng
Ev
erycov
eri
ng (
ii
) Cont
ainsev
eryv
ert
exoft
hegr
aphonl
yonce
Non-
planargr
aph (
ii
i)Cont
ainK5orK3,3assub-
graph
(
a)A–3 b–1 c–2 (
b)a–2 b–1 c–3
(c) a–2 b–3 c–1 (
d) Noneoft
hese Ans.:(
b)
Q.40 ThegraphQK
K
(
a)has2 v
ert
ices (
b)Ki
sregul
ar
(
c) Bothaandb (
d)Noneofthese Ans.:(
c)
Q.41 I
fG isapl anargr
aphwi
th35regi
onseachofdegr
ee6,t
henumberof
v
ert
icesar
e,
(
a)70 (
b) 80 (
c)72 (
d)62 Ans.:
(c)

Q.42 Chr
omat
icnumberofat
reewi
thnv
ert
icesi
s
(
a)n–1 (
b)n+1 (
c) 2n (
d)(
n/2) (
e)2 Ans.:(
e)

5
Uni
t4:Gr
aphTheor
y
Q.43

G1 G2 G3

Whi
choft
hef
oll
owi
ngi
str
ue?
G2andG3ar
eisomor
phi
c (
b)G1andG2ar
eisomor
phi
c
(
c) G3i
sasi
mpl
egr
aph (
d)G1,
G2andG3ar
esi
mpl
egr
aph
Ans.:(
b)
Q.44 Chr
omat
icnumberoft
hef
oll
owi
nggr
aphi
s
(
a)2 (
b) 3 (
c) 4 (
d)5 Ans.:(
b)

Fi
g.Q.44

Q.45 Knhasper
fectmat
chi
ngi
fni
s
(a)odd (
b)ev en ( c) pr
ime (
d)4 Ans.:(
b)
Q.46 Consi
dert
hef
oll
owingstat
ement
S1:
Apl
anargr
aphi
s5col
our
abl
e
S2:
Kni
spl
anari
fn4
(
a)bot
hS1andS2ar
etr
ue (
b)S1i
str
ue
(
c) S2i
str
ue (
d)none Ans.:
(c)
Q.47 Thedi
amet
eroft
hef
oll
owi
nggr
aphi
s

Fi
g.Q.47
6
Uni
t4:Gr
aphTheor
y

(a)2 (
b) 6 (
c)5 (
d)3 Ans.:(
d)
Q.48 Consi
dert
hegraphG1andG2

G1 G2

Fi
g.Q.48

Whi
choft
hef
oll
owi
ngi
str
ue
(
a)G1hasEul
erci
rcui
t (
b)G2hasEul
erci
rcui
t
(c) Both(
a)and(
b)arevali
d (d)None Ans.:(a)
Q.49 I
fagr aph(G)i
saconnect
edplanargraphwi
theedgeandvvert
iceswher
e
v3t hen
(
a)e=3v–6 (
b)e3v–6
(
c) e=3v+6 (
d)e3v+6 Ans.:(
b)

7
Uni
t4:Gr
aphTheor
y
Q.50 Thenumberofperf
ectmat
chi
nginatreewithnvert
icesi
s
n(n–1)
(a)2 (
b)1 (c) n–1 (
d)
2
Ans: (b)
Q.51 Deter
minet
hechromati
cnumberoft
hef ol
l
owinggraph.

Fi
g.Q.51

(a)2 (
b)3 (
c) 4 (d)5 Ans.:
(c)
Q.52 Thechr
omat
icnumberofast
argr
aphwi
thnv
erti
cesi
s
(a)2 (b) 4 (c) n–1 (
d)n/
2 Ans.:(
a)
Q.53 Chromat
icnumberofacompl
etegraphKni
s
(a)n (
b) n/
2 (
c)n–1 (d)n+1 Ans.:(
a)
Q.54 Ever
ybi
par
ti
tegr
aphhav
et hechr
omat
icnumber
(a)n (
b) n–1 (
c) 2 (
d)n/
2 Ans.:
(c)
Q.55 Consi
dert
hegraphG1andG2

G1 G2

Fi
g.Q.55

Whi
choft
hef
oll
owi
ngi
str
ue?
(
a)G2hasEul
erpat
h (
b)G1hasnei
therEul
erci
rcui
tnorEul
erpat
h
(
c)Both(a)and(
b) (
d) Noneoft
hese Ans.:
(c)
Q.56 Consi
derthegr
aphG1andG2

Fi
g.Q.56

8
Uni
t4:Gr
aphTheor
y

(
a)G1hasHami
l
tonci
rcui
t
(
b)G2hasHami
l
tonci
rcui
t
(
c) Nei
therG1norG2hasHami
l
tonci
rcui
t
(
d)Bot
hG1andG2hav
eHami
l
tonci
rcui
t Ans.:(
b)

Q.57 Whati
sthehei
ghtoft
hegi
vengr
aph?

Fi
g.Q.57

(a) 3 (
b) 4 (c) 5 (d)2 Ans.:(
b)
Q.58 Comparethet
wof
igur
esandconcl
ude

Fi
g.Q.58

(
a)I
somor
phi
c
(
b)Noti
somor
phi
casG2hasnov
ert
exwi
thi
ndegr
ee=2
(
c) Noti
somor
phi
casG2hasnov
ert
exwi
thout
degr
ee=2
(d)both(b)and(
c) Ans.:(d)
Q.59 Themini
mum numberofedgesi
naconnect
edcy
clegr
aphofnv
ert
icesi
s
(a)n–1 (
b)n ( c)n+1 ( d) None Ans.:(
b)
Q.60 Thedegr
eeofeachreasoninapol
yhedr
agr
aph(
degr
eeofeachr
egi
on3)
wit
h12vert
icesand30edgesi
s,
(
a)2 (
b) 4 (
c)3 (
d)5 Ans.:
(c)

Q.61 Fi
ndt
hel
eastnumberofv
ert
icesofacompl
etegr
aphhav
ingatl
east50
9
Uni
t4:Gr
aphTheor
y
edges.
(
a)25 (
b) 20 (c)15 (d)10 Ans.:(
d)
Q.62 Agr
aphneedsachromat
icnumbern.Thi
scanbeshownby
(
i) Showi
ngt
hatt
hegr
aphcanbecol
our
edwi
thncol
our
s
(
ii
) Showi
ngt
hatt
hegr
aphcannotbecol
our
edusi
ng<ncol
our
s
(a)only(
i) (b)onl
y(i
i
) (
c)(
i)and(i
i) (d)None Ans.:
(c)
Q.63 Findt
hechromati
cnumberoft
hegivengr
aph.

Fi
g.Q.63

(a)3 (b) 4 (
c)5 ( d)2 Ans.:(
b)
Q.64 Chromat
icnumberofcycl
egr
aphCn,
n>1andni
sodd.
(
a)2 (
b) 3 (
c)4 (
d)1 Ans.:(
b)

Q.65 Chr
omat
icnumberofcy
clegr
aphCn,
n>1andni
sev
en
(
a)2 (
b) 3 (
c)4 ( d)1 Ans.:(
a)
Q.66 Wheel
graphchr
omat
icnumbern,
n>2ifni
sodd
(
a)3 (
b) 4 (
c)2 (
d)1 Ans.:(
a)

Q.67 Chr
omat
icnumberofawheel
graphn,
n>2i
fni
sev
en
(
a)1 (
b) 3 (
c)4 (
d)2 Ans.:
(c)

Q.68 Agr
aphwhi
chconsi
stsofonl
yisol
atedv
ert
exhaschr
omat
icnumber
.
(a)2 (b) 1 (
c)3 (d)Noneoft hese Ans.:(
b)
Q.69 Agraphhasoneormor
eedges(
wit
houtsel
floop)hasamini
mum chromati
c
number?
(a)2 (b) 3 (c)4 (d)1 Ans.:(
a)
Q.70 Ever
ytr
eewi
thtwoormor
ever
texhaschr
omat
icnumber
.
10
Uni
t4:Gr
aphTheor
y

(
a)1 (b) 2 (c)4 (
d)3 Ans.:(
b)
Q.71 Agr
aphhaschr
omati
cnumber2i
fandonl
yifi
thasnoci
rcui
tsofoddlengt
h.
(a)True (b) Fal
se Ans.:(
a)
Q.72 I
fdist hemaxi
mum degr
eeoft
hev
ert
icesi
nthegr
aphGt
henchromati
c
numberofGi
s
(
a)d+1 (
b)d+1
(c) d–1 (d)d–1 Ans.:(
a)
Q.73 Themini
mum numberofedgesi
naconnect
edgr
aphwi
thnv
ert
ices
(
a)n–1 (
b)n ( c)n+1 ( d) Noneoft
hese Ans.:(
a)
Q.74 Agr
aphi
spl
anari
fandonl
yifi
tdoesnotcont
ain
(
a)Subgr
aphhomeomor
phi
ctoK3andK3,3
(
b)Subgr
aphi
somor
phi
ctoK5orK3,3
(
c) Subgr
aphi
somor
phi
ctoK3andK3,3
(
d)Subgr
aphhomeomor
phi
ctoK5orK3,3 Ans.:(
d)
Q.75 Maxi
mum numberofedgesi nan-
nodeundi
rect
edgr
aphwi
thoutsel
floopi
s
2 n(
n–1) n(n+1)
(a)n ( b) (
c)n–1 ( d) Ans.:(
b)
2 2
Q.76 Thev
er t
exconnect
ivi
tyofK5i
s,
(
a)2 (
b) 3 (
c) 4 (
d)1 Ans.:
(c)

Q.77 I
fever
yedgeofthegraphGappearsexactlyonceinthepat
htheni ti
s
(
a)Hami lt
onpath (
b)Euleri
anpath
(
c) Simpl
epath (
d)Shortestpath Ans.:(b)
Q.78 I
fagraphpossessesei
therzer
oortwov ert
icesofodddegr
eet henitis
(
a)Hami lt
onpath (
b)Eul er
ianpath
(
c) Simpl
epath (
d)Shortestpath Ans.:(b)
Q.79 Aconnect
edgraphhavi
ngt hedegr
eeofallvert
icesi
seventhenitcontains
(
a)Hami
l
tonci
rcui
t (
b)Si
mpl
eci
rcui
t
(
c) Eul
eri
ancir
cui
t (d)Noneofthese Ans.:(
c)
Q.80 Adi
rect
edgraphpossessesanEul
eri
anci
rcui
tifi
tisconnect
edandthe
(
a)I
ncomi
ngdegr
ee=out
goi
ngdegr
ee
(
b)I
ncomi
ngdegr
eeout
goi
ngdegr
ee
(
c) I
ncomi
ngdegr
ee>out
goi
ngdegr
ee
(
d)I
ncomi
ngdegr
ee<out
goi
ngdegr
ee Ans.:(
a)
11
Uni
t4:Gr
aphTheor
y
Q.81 I
fev
eryv
ert
exofagr
aphi
sappear
ingex
act
lyoncet
heni
tis
(
a)Hami
l
tonpat
h (
b)Eul
eri
anpat
h
(
c) Si
mplepat
h (d)Shor t
estpat
h Ans.:(
a)
Q.82 I
fG beasimpleconnectedgraphandsum oft
hedegr
eeofeachpai
rof
v
ert
ex(n–1)thenitcontai
ns
(
a)Eul
eri
anpat
h (
b)Hami
l
tonpat
h
(c) Si
mpl epath (
d)None Ans.:(b)
Q.83 Fora connect ed gr
aph having Hamil
ton ci
rcuit
,which condit
ion t
o be
sat
isfi
ed
(a)degr eeofeachvert
ex=n–1 (
b) degr eeofeachvertex=n
(c) d(v)n/ 2 (
d) d( v
)=n+1 Ans.:(c)
Q.84 Asimplegr aphinwhichther
eex i
stsanedgebet weenever
ypairofv er
texi
s
cal
led
(
a)Compl
etegr
aph (
b)Eul
ergr
aph
(c) Pl
annargr
aph (d)Regul
argr
aph Ans.:(
a)
Q.85 Theminimum numberofspanningt
reei
naconnect
edgr
aphwi
thnnodei
s,
(a)1 ( b) 2 ( c) n–1 ( d)n/ 2 Ans.:(
b)
Q.86 Ifagraphrequi
rekdi
ffer
entcolour
sfori
tspr
opercol
our
ing. Then
chromati
cnumberofthegraphis,
(a)1 (
b) k (
c)k–1 (d)k/2 Ans.:(
b)
Q.87 Thenumberofcol our
srequi
redt
opr
operl
ycolourt
hev
ert
icesofevery
planargr
aphi
s
(a)2 (b) 3 (
c)4 (
d)5 Ans.:(
a)
Q.88 Degr
eeofeachvertexi
nKni
s,
(a)n (
b) n–1 ( c)n–2 ( d)2n–1 Ans.:(
b)
Q.89 Commondat
aforQ.90t
o92Vert
exV6i
scal
led

Fi
g.Q.89

(
a)Pendantv
ert
ex (
b)I
sol
atedv
ert
ex
12
Uni
t4:Gr
aphTheor
y

(c) I
nci
dentvert
ex (
d)Adj
acentv
ert
ex Ans.:(
b)
Q.90 Vert
exV5iscall
ed
(
a)Pendant (
b)I
sol
ated
(c) Adj
acent (
d)I
nci
dent Ans.:(
a)
Q.91 Edgee4iscal
led
(
a)Sel
floop (
b)Par
all
eledge
(c)Inci
dent (
d)None Ans.:(
b)
Q.92 edgee6iscal
led
(
a)Par
all
eledge (
b)Sel
floop
(
c) I
nci
dentedge (
d)None Ans.:(
b)
n
Q.93 I
nagr
aphG  d(V)=?i

n=1
(a)e (b) 2e (
c)e/2 (d)3e Ans.:
(b)
Q.94 Thenumberofvert
icesofodddegr
eei
nagraphi
sal
way
s.
(a)Odd (
b)Ev en ( c) 2e (
d) None Ans.:
(b)
Q.95 How manynodesarerequir
edtoconstr
uctagr
aphwi
thexact
ly6edgesin
whicheachnodei
sofdegree2.
(
a)4 (
b) 7 (
c) 6 (
d)8 Ans.:(
c)

Q.96 Whatist
henumberofedgesi
nagr
aphwi
th6nodes,
2ofdegr
ee4and4of
degr
ee2.
(
a)6 (
b) 8 (c)7 (d)5 Ans.:
(b)
Q.97 Whet
herK6andK3,3ar
eisomor
phi
c?
(
a)Tr
ue (
b)Fal
se Ans.:
(b)
Q.98

Fi
g.Q.98

G1andG2ar
eisomor
phi
c
13
Uni
t4:Gr
aphTheor
y

True (b) False Ans.:(


a)
Q.99 Doesthegr
aphK1,3 haveEul
eri
anci
rcui
t?
(
a)Yes (
b)No Ans.:(
b)

Q.100 Howmanyedgesmustapl
anargr
aphhav
eifi
thas7r
egi
onsand5nodes?
(a)8 (b) 10 (c) 12 (d)14 Ans.:(
b)
Q.101 How manynumberofregi
onsdefinedbyaconnect
edpl
anargr
aphwi t
h6
nodesand10edges.
(a)4 (b) 6 ( c) 8 (d)10 Ans.:(
b)
Q.102 Aconnectedpl
anargr
aphhasni
nev
ert
iceshav
ingdegr
ee2,
2,2,
2,3,3,3,4,
4,and5.
Howmanyedgesar
ether
e?
(
a)10 (b) 12 (c)14 (d)16 Ans.:
(c)
Q.103 I
nthesameprobl
em asi
nQ102,howmanyr
egi
ons?
(a)4 ( b) 6 ( c) 7 (d)8 Ans.:(
c)
Q.104 LetG1beasi mpleconnectedplanargraphwith13v
ert
icesand19edges.
Thusthenumberoffacesi
nt heplannergr
aphis
(a)6 ( b) 8 ( c) 9 (d)13 Ans.:(
b)
Q.105 Themax i
mum no.ofedgesinaplanargraphis
(a) 3V–6 (b) 2V–4
(c)2e (d)
None Ans.:( a)
Q.106 Thenumberofconnectedcomponenti nGis
n/
2 n
(
a)n(b)n+2 (
c)2 (
d)2 /n Ans.:(
b)
Q.107 Whi
chofthef
oll
owi
nggraphhasanEul
eri
anci
rcui
t?
(
a)Anyk-
regul
argr
aphwher
eKi
sanev
ennumber
s.
(
b)Acompl
etegr
aphon90v
ert
ices.
(
c) Thecompl
ementofacy
cleon25v
ert
ices.
(
d)Noneoft
hese Ans.:(
a)
Q.108 Whi
choft
hef
oll
owi
ngst
atement
sint
ruef
orev
erypl
anargr
aphonnv
ert
ices.
(
a)Thegr
aphi
sconnect
ed
(
b)Thegr
aphi
sEul
eri
an
(
c) Thegr
aphhasv
ert
ex-
cov
erofsi
zeatmost3n/
4
(
d)Thegr
aphhasani
ndependentsetofsi
zeatl
eastn/
3. Ans.:(
a)

14
Uni
t4:Gr
aphTheor
y
Q.109 Whatisthenumberofver
ti
cesinanundir
ectedgr
aphwi t
h27edges,6
ver
ti
cesofdegr
ee2,
3ver
ti
cesofdegr
ee4andremai
ningofdegr
ees3?
(a)10 (
b)11 (c)18 (d)19 Ans.:(
d)
Q.110 Consi
dert
hegr
aphshownbel
ow.Thev
ert
exconnect
ivi
tyoft
hegr
aphis

Fi
g.Q.110

(a)1 (b) 2 (c) 3 (d)4 Ans.:(


b)
Q.111 Consi
dert
hegr
aphshownbel
ow.Theedgeconnect
ivi
tyoft
hegr
aphi
s

Fi
g.Q.111

(a)1 (b) 2 ( c) 3 (d)4 Ans.:(


a)
Q.112 Theedgeconnect
ivi
tyf
ort
hecompl
etegr
aphK6i
s
(a)5 (b) 3 ( c) 2 (d)4 Ans.:(
a)
Q.113 Thev
ert
exconnecti
vi
tyf
orthecompl
etebi
par
ti
tegr
aphK3,
4is
(
a)1 (b) 4 (c) 3 (d)2 Ans.:
(c)
Q.114 Agr
aphwhi
chhasanHami
lt
onci
rcui
tiscal
l
ed
(
a)Hami
l
tongr
aph (
b)Compl
etebi
par
ti
tegr
aph
(c) Eul
uri
angraph (d)Noneoft
hese Ans.:(
a)
Q.115 Thecompletebipar
ti
tegr
aphK2,
4has
(
a)Eul
uri
anci
rcui
t (
b)Hami
l
tonci
rcui
t
(
c) nei
thereul
uri
annorHami
l
tonci
rcui
t
(d)botheul
uri
annorHamil
tonci
rcui
t Ans.:
(**
)
Q.116 Consi
dert
hefoll
owi
nggraph.I
thas
(
a)Eul
uri
anci
rcui
t (
b)Hami
l
tonci
rcui
t
(
c) bot
h (
d)nei
ther

15
Uni
t4:Gr
aphTheor
y

g.Q.116Ans
Fi .:(
b)

Q.117 Consi
dert
hef
oll
owi
nggr
aph.I
thas
(
a)Eul
uri
anci
rcui
t (
b)Hami
l
tonci
rcui
t
(c) both (
d)nei t
her g.Q.117 Ans
Fi .:(
d)
Q.118 Themi ni
mum numberofcol
orsr equi
redt
opr
oduceapr
opercol
ori
ngofa
simpleconnect
edgr
aphGiscal
led
(
a)chr
omat
icnumberofG (
b)edgeconnect
ivi
tyofG.
(
c) Vert
exconnect
ivi
tyofG (d)noneofthese Ans.:(
a)
Q.119 I
fagraphGisisomorphi
ctoit
scomplementt
henGi scal
l
ed
(
a)compl
etegr
aph (
b)bi
par
ti
tegr
aph
(
c) Sel
fcompl
ement
arygr
aph (
d)Noneoft
hese Ans.:
(c)

16
Uni
t4:Gr
aphTheor
y
Q.120 Consi
dert
hegr
aphG1andG2bel
ow.ThenG1UG2i
s

Fi
g.Q.120

(
a) (
b)

(
c) (
d) Ans.:(
b)

Q.121 I
nthepr
evi
ousquer
ti
onG1nG2i
s
(
a) (
b)

(
c) (
d) Ans.:
(c)

Q.122 Consi
dert
hef
oll
owi
nggr
aph,
thev
ert
exconnect
ivi
tyi
s
(
a)1 (
b) 2 (
3)4 (
d)3 Ans.:(
b)

17
Uni
t4:Gr
aphTheor
y
Fi
g.Q.122

Q.123 Consi
dert
hef
oll
owi
nggr
aphandf
indt
heedgeconnect
ivi
tyoft
hegr
aph
(
a)1 (
b) 3 (
3)2 (
d)4 Ans.:(
b)

Fi
g.Q.123

Q.124 Consi
dert
hegr
aphG1andi
tssubgr
aphG2.

Fi
g.Q.124

Thensubgr
aphG2i
scal
l
ed
(
a)compl
etesubgr
aph (
b)r
egul
arsubgr
aph
(c) spanningsubgr
aph (d)noneoft
hese Ans.:
(c)
Q.125 ConsiderthegraphGandi
tssubgr
aphH1andH2.

Fi
g.Q.125

ThenH1andH2ar
e.
(
a)Ver
texdi
sjoi
ntsubgr
aph(
b)spanni
ngsubgr
aphs
(
c) Regul
arsubgr
aphs (
d)noneoft
hese Ans.:(
a)

18
Uni
t4:Gr
aphTheor
y
Q.126 Consi
dert
hef
oll
owi
nggr
aphGandi
tssubgr
aphH1andH2.

Fi
g.Q.126

ThenH1andH2ar
e.
(
a)v
ert
exdi
sjoi
nt (
b)edgedi
sjoi
nt
(c) spanni
ng (d)noneoft
hese Ans.:(
b)
Q.127 Theadjacencymat
ri
xfort
hefol
lowi
nggraphi
s

Fi
g.Q.127

[ ] [ ]
01001 11001
10011 11011
a) 0 0 0 1 0
( b) 0 0 0 0 1
(
01100 10001
11000 00001

[ ] [ ]
01101 01001
11111 11110
c) 0 1 1 1 0
( d) 0 0 0 0 1
( Ans.:(
a)
00001 11100
11101 00011

19
Uni
t4:Gr
aphTheor
y
Q.128 I
fGi
sasimplegr
aphonnver
ti
cesandt
hedegr
eeofeachv
ert
exi
s
(
n–1)t
henthegraphi
s:
(
a)bi
par
ti
tegr
aph (
b)nul
lgr
aph
(
c) compl
etegr
aph (
d)Noneoft
hese Ans.:(
c)

Q.129 I
nthef
oll
owi
nggr
aph,
theadj
acentv
ert
exar
e:
(
a)e1ande3 (
b)e2ande5
(
c) e1ande4 (
d)Noneoft
hese Ans.:(
b)

Fi
g.Q.129

Q.130 I
nthef
oll
owi
nggr
aph,
theadj
acentv
ert
exar
e
(
a)v
1andv
2 (
b)v
2andv
4

(
c) v
1andv
3 (
d)Noneoft
hese
Fi
g.Q.130
Ans.:(
a)



20

You might also like