97800419 seat
[Link], 2423
St boag $2 10\
(For the candidates admitted from 2023-2024 onwards)
23UMAA06
B.C.A/[Link]. DEGREE EXAMINATION,
APRIL/MAY 2025
First to Fourth Semester
Allied - GRAPH THEORY AND ITS APPLICATION
(Common for : All Computer Science Course)
Time : Three hours Maximum : 75 marks
PART A —(15 x 1 = 15 marks)
Answer ALL questions.
1. The degree of isolated point is
fa) 1 (b) 0
() 2 (@) 3°
BANSS (poneruSert Ug.
(A) 1 (<4) 0
(Q) 2 (rr) 3
@ scanned with OKEN Scanner Every cubie graph has —————— number of
points.
(a) Wither even or odd
(b) Even J
c oO
(d) Odd
AMAT CUUg_ Gam OGHss op
cree sensuslerrran (pencrscnet Clem eiorig. 158 Gud
(91) QrLor saoog! Erheom
(%) Qoror
(Q) 0
() @ibeop
G, UG, isa
(a) (p, + Pos% +4)
(b) (Pp, + Poh + G2 + P1Q2), 7
(c) (P.P2, MP2 + dP,)
(da) Empty
graph.
G, UG, aes eG
(2) (P+ Py.a1 +2)
(8) (P, + Pod, +42 + piQy)
(D) (PrP2, 4, + ap,)
() Geax)
GarQo.
2 [Link], 2423
@ scanned with OKEN Scanner 4. Ina Graph G, single point is a walk of length
(a) 1 b) 0.7%
@ 2 @) 3
8G Carl OG Guo OG ~Peomujeu HeoruSer
Sons ———__.
(4) 1 (=) 0
(Q) 2 (mr) 3
5. Each line of a graph lies in —————— ff its
block. ;
(a) Exactly one (b), Atleast one
(c) Atmost one ff (d) Two
2G Gam QGgeller gaGang AMaflidyid xs1ser
Asre@uisle 2 crengy.
(a1) shure EG (%) Goppsucsb EG
(Q) sGaucsd gq (F) Qyan@
6. The connectivity of a connected graph with a cut
point is Z
(a) 0 (by) 2
() 3 qd) 1/7
BG GaulG yerafuror Qoonsstur. EG
Gem _Q paler Qenoortsy
(<2) 0 (<9) 2
(@) 3 (i) 1
03 [Link]. 2428
@ scanned with OKEN Scanner In a theta graph, a block with 2 non adjacent
vertices have degree.
(a) 0 (b) 2
(Ce (d) 3
Stir Car Ggale 2 265665 aang
YoOsoayoiu AgsnGS Gerreig GSE uty.
(21) 0 (
T (4) Gp-il
G aeug 96 (p,q) Qeamns Camo crafle
(2) q=p-l (4) q2p-1 |
@) ap-l
The algorithm for finding a shortest spanning
tree in a weighted graph G was given by
(a) Kruskal (b) Theta
(c) Dijkstra “(d) Euler
coy Gor Qu Go GMAW sarrey wy ses
ado O ly GUSDETET Lg. Qpenpenu AanOssouy
(SH) G@HAcvad (4) Stour
(3) gevddvi_gm (FF) wien
If each operand has a unique image, then the
transformation is called
(a) Single valued (b) Double valued
(c) Multi valued (d) None
- 6 [Link]. 2423
@ scanned with OKEN Scanner 16.
HAGAING Quasseptd EG SaNsgrasorren ocHarsens,
Garatig. dpsed 5s XaHombhmw
AOYSSEIUGAlDy.
(&) Qdeop WA UYoOLugy
(&) QrL@r wAUYe ug)
(@) ve wslUYorwgy
(FF) eTgy@yuSlevenao
Grenry)
The Kinematic graph of the identity
transformation on n elements consists of
isolated loops.
(a) n-1 (b) *n+1
© n @ 0
Nn eMUYyscha soG eGumpsHer QusésGue
Gen @@ = ———— sails cu@natumsenat
Gane Qdrengy.
(s) n-1 (<9) n+1
(Q) n (r) 0
PART B.— (2 x 5 = 10 marks)
Answer any TWO questions.
Prove that in a Graph G, 6 < 2¥, 3
vertices and 6>P then G
Q° is
Hamiltonian.
G aéng, p23 qpenensdr POLWS! wmwd
52% aah G qu GandldoGurafuer
auenyy crest Almas.
Or
Prove that (CG) is well defined.
(ca) TELS! [HOTEG, uso puss Lg) rer
Bloayss.
10 [Link], 2423
@ scanned with OKEN Scanner of (a) WG be a (p,q) graph, then prove that the
following statements are equivalent
(i) G isa tree
(ii) Every two points of G are joined by a
unique path
(iii) G is connected and p=q+1.
G aémug, 96 (p,q) Gar GG arated
Epsncimuma genms Gamrenp) sib crest
slays.
Gi) G g@ wb
Gi) Ger obs Qq usralaeb gCy EG
ureguire wt @Gw
QoorstulyGsed
(iii) G Qeoempgsg: who p=qtl.
Or
(b) Prove that every tree has a centre
consisting of either on point or two adjacent
points.
aS QW gd Slor oousHend gay ydrellGur
Hows Oy sieéorenei ydralaGarn Qejs qd
arent Bias. \;
he in © [Link]. 2423
@ scanned with OKEN Scanner Find the shortest distance from vertex A to
all vertices in the following weighted graph.
25. (a)
Cc o>”
Glereugid cren_uyetet. Gam_Q aha (ener
AVIA GH Binwssy amaepseo Wes
So4Aw gijso5 ser _Hweyw.
rug
A oe a
b 2 : :
(b) Explain | transformation and Kinematic
graph with example.
CHW OLD Lopond usd i
omy) Q\wss5Nwe Cam a
ADH 5.451 O_err ofllard ayes Some
12 [Link]. 2423
@ scanned with OKEN Scanner
