_Total No. of Pages: 02 Roll No.

_ _ _ _ __
•7th SEMESTER
I.111:11 1111)
MID SEME STER . EXAMINATION Sep-2 02j

MC 405 GRAPH THEORY

Time: 1:30 Hours • ·Max. Marks: 20

Q.l [a] Find x s~ch that the degree sequence·[B,x, 7;6,6,~,4,3,3,1,1,1]

is a graphical vector~_ · (2) [COl,2 ]

[b] • Solve the modified Konigsberg Bridge problem. ·by •

• I •

considering the cases below: . , • . (3) [COl,3 ]

,

i. Deleting two. edges from the graph. ·..

. · ii. Constructing two new edges in the graph
iii. Deleting an edge and constructing an e_dge

Q.2[a] Define isomorphism. Determine if the graphs given H1 and H2

given be1ow are isomorphic~ • (3)[C0 1,4] •

W'1 y·1
U1.
. ...
.• •.R 2 ,.
..
H
. 1 •

tJ.1 Zt z1.
Figure 1: Isomorphism

[b] The degrees of the vertices of a certain tree T of order 13 are 1, 2

and s. If T has exactly three vertices of degree 2, how many end-
vertices does it have? (2)[C01,2]

P.T.O.
1
 . .
. h ·hortest p~th frqm ve~e~ _1 .to vertex 4 and Vert •
Q.3 Find t e s . ex 2 t()
.
•
vertex 3.
4

,, .

. 1

-7

•
. j

• Figure 2: Shortest Path Problem • • • •

Q.4 . .. . .. . .. . . . :
. .[a] Describe the differences :between T~av~iJing· S~lesmarr Pro.bl~1n
and_ Chinese Postman Problelll.. . • • -•• , ::· ·.
• ··-···,; )-· · (~)(C02~4]
[b] Use Prim'~ algorithm to ·find the minimal :spanning tte~
graph l?elow.
in th~ -··
. . . ·, 1 • i
.
<-' ._ (3)[C02] - ..
• _· _ : . ·:__ - • . . - :

l :' •
• ~.' ! .

• '
. .
. : -~ I 3
. • ·t . '
I •

16 I '

14 12
12 -14

16

15
Figure 3: Prim•
s Algorithm

2
 Total No. of Pages: 02 Roll No. _ _ _ _ __
• 7thSEMESTER
I.TICII IICJ
END SEMESTER EXAMINATION NOV-2023
' '-

MC:,405 GRAPH THEORY

' .

Time: 3:00 Hours Max. Marks: 40

J~p.te~ :Aft'., ij\:Je$tiPhs:,~n;y· eqµ~1 , rr,~k$. AsSume '$Uitab!e ·.•·,r:ti~~lrJ9 dat~, if
•- ,
·
-.~nY:/ < __
. :- · ,.. ·. .
_: ::~>,,/:-? --<< . , i< < •••..·.• .-_ ." ··•<. · ... ·:·· . .'.::.
.:.i.. ·. ·-... .·;·,;•_..-··~:-f:T-EM~)'AN(V:,,8,{:Q.Q'.~STIONS :·...·
\ •
, .· · ... -.
•· •••• -
·. .
i
~ . • '"', .
I Q.1 Find the degree of each verteXc and number of edges in the following graphs:
(5)[COI]
.
1. Complete Graph with n vertices. 'Vl -J
..
11. k-Regular graph ~ Nf, 9
•
"2,.--
Q.2 . .

[a] Prove "If a graph has exactly two vertices of odd degree, then there must
be a path joining these two vertices". (2)[C01]
[b] What do you understand from the statement:
"In a graph, branches and chords change with respect to a
• " A..t-2.
spanning tree. ~ 1 "- a . ~ I l R. v (3)[COI]
1
Q.3 Let G be a simple connected graph with n vertices, n 2 . G has ~
Hamiltonian circuit if deg(u) + deg(v) ~ n, where u and v are non-
adjacent verti~es. (5)[C02]
Q. 4 [a] Find the maximum
· number of edges 1n
• a simp
• Ie b.1partite
.
:") graph. r1'-/L.f . · (3)[COI]
~ ,, (b] Find the number of pendant vertices in a binary tree.
'l.±1 (2)[C01',4]
2--
Q.5 Prove that a tree with n vertices has (n-1) edges. (5)[C02]

Q6. .
[a] Is the following statement _true or_ false? If all edges in ~ flow network have
distinct capacities, then there 1s a unique path for the possible maximum. flow.
Justify your answer with a (short) proof or ,_give . ·a counter example.
No , et~' e- • C3)[co3,4J
1
•
{b} Prove that number of vertices in a bi na ry tre e is al wa ys
od d. (2 )( co2 ,
31
Find a solution to th e Chin
Q7• ese Po stm an Pr ob le m in th
• e ne tw or k below: , ".. Q
• (5 )[C 02 ,3 ,4 ] tJJH'
~ \(
-1 4 3 ~ 2 L ~
~~

Chinese Pos
Q. 8 How many perfect matching tman Problem 1
s are po ss ib le in th e fo llo
(S )(C 02 ) ~ 11\ J\
wi ng graphs:
00 • ,.. ,~ I - _J jJ
---R.,, (~~ ~~- ~
i.
ii.
Kn, a complete graph
Cn, a cycle
A : 1_,:. N,o-t ~
c!}.. h l'l ~ ~
~ . ~e -l - ..
Q.9 As a result of doing we
ll on an exam, six stu de nt s
Charles (C) , Duane (D) , Elke As hl ey (A )-, Br uc e( ~) ,
(E) an d Faith (F) ha ve ea rn ed
a complimentary textbook th e rig ht to receive
in eith~r algebra (a), ca lcu
equations (d) , geometry (g) lu s (c), differential
, history of mathematics (h
topology (t) . There is only on ) ·, pr og ra m m in g (p) or
e book on ea ch of th es e su bj
of the students are ec ts. Th e preferences
•

A:d,h,t ; B:g,p,t ,· ~
C:a g h • D· h pt · E· a c
' ' ' • ' ' ' . ,. ' d '· F·•c' dp
'
Can each of the students receiv
e a bo ok he or sh e lik es ? Ye
&. . • (S)(C03,41
Q. 10 Prove that every circu
cut-set. it has ev en number of edges
in common with an21y
(S)(CO

I
.
•

2
Total No. of Pages: 02 Roll No. _ _ _ _ __
7t.h SEMESTER
~- : B.TICIIIICJ- - ·1 -
MID SEMESTER EXAMINATION Sep-2022

MC 405 GRAPH THEORY

Time: 1:30 Hours Max. Marks: 20
. ·Note: All questions are compulsory. AsSume:suitable missing
• data,· if any. • ·_ • • • • •
,. ..
. . .
. . . . '

-Q.f Choose the.correct option."Justify.

I. • Which of the following sequences cannot •be the degree
sequence of any sin1ple graph? [C03]
A. (7, 6, 5, 4, 4, 3, 2, 1) B. (6, 6, 6, 6, 3-, 3, 2, 2)
C. '(7, 6, 6, 4, 4, 3, 2, 2) D. (8, 7, 7, 6, 4, 2, 1, 1)
a) A and B c) CandD
b) D only d) Band D

II. Indicate \Vhich of the following graphs· have an •·Eulerian

Circuh,- where the edge set of the graph is denoted by the· set
E. [C03]
a) E= {( 1,2),( 1,2),(2,3 ),(3,4),(4,5\(4,5)}
b) E= {(4,5),(1,3),(1,3),(2,3),(2,4),(4,5)}
c) E= {(4,5),( 1,3 ),( 1,3 ),(2,3),(3,4),(4,5)}
d) E= {(1,3),(.3,4),(l ,2),(2,3),(3,5),(4,5)}

III.. A cycle ori n vertices is isotnorphic to its compl~ment. The

value of n is__ [CO2]
a)'2 . b) 4
c) 6 d) 5

P.T.O.

1
 • that at any party with six people, there. are thr • Ct>Ll
Q 2[a] Prove . ee ll1 7
.• • . tances or non-acqua1ntan~es. ( UtuaJ
acqua1n 3)[Coi,
21
Can a simple graph ha;ve 5 vertices an_d 12 edges? If so .
[b] . . • "bl h . , draw It·
if not, explain why 1t 1s not poss1 e to ave such a graph. Ct>f
. . . (2)[C02]
. [c] Can a disconnected graph be an Euler Gr~ph? Justify. (l)[C0 ]
3
• · ·1
Q. 3 Show that a s1mp e connec-ted •gr_ap h G wit• h n vertices,
LJ»(
n ~3 is
Hamiltonian if
deg(v) > (i) 'It v e V(G) Col • -
, where deg(v) is the degree of the a vertex v: (4) [C02,3]

Q.4 The following network sho\YS the distances, in kilometres, of roads

connecting ten towns. •
B E 3 G

. . . I.
. ... '

•. . ·,. .•· ...

. F... • ; •· 13: : •• I "'

:
An ambulanc·e· ~s:•·bas·
·• •. •
eel .A·
··
. : .
·
• .
: •
d emergen
at J.
••.. • . at and has· to respon to an cy
. d to
Use Di1k$tra's al. •
·.1 •

. require
111 ;, gonthm t.o find _the minimum distance [CO 1,3]
Ind Stl':te the route. . (4) ·
\.

. ,, .,•"
..' , ..
. -:~·· •......

. : .-. : ' •.. I ••

 1:r====:=:a==---~'llWIJi..,e~..--~~--=:::::::::~~--
}\
-
Total no. of Pages: 04 Roll no ............ •········

I.TN lllll
7th SEMESTER

END TERM EXAMINATION Nov- 2022

MC 405 Graph Theory

Time: 03:00 Hours Max. Marks: 40

Note : Q1-6 are compulsory. Attempt any two parts in Q 7.

Assume suitable missing data, if any. .

Q. l Prove or Disprove the statement: 'Every tree has at most one perfect
matching'. [5][C01]

Q.2·
a) Suppose that in a group of 5 people: A, B, C, D and Ethe following
pairs of people are acquainted with each other.
• A and C
• A and D
• Band C
• C and D
• C and E
Draw a graph G to represent this situation and find an adjacency
matrix for G. [2][C01]

b) The degrees of the vertices of a certain tree T of order 13 are 1, 2

and 5. If T has exactly three vertices of degree 2, how many end-
vertices does it have? [3][C01]

..
Q.3 ~

-
I

a) How many cycles can exist in an electric circuit with 1O

• connections and 7 nodes? Explain. [l][C0 4]

b) In the given graph, how many intermediate vertices are required to

travel from node '1' to node '3' at a minimum cost using Floyd
WarshaII Algorithm. [4][C03]
1
Q.4
a) Describe major difference between Prim's and Kruskal 's algorithm.
Use Prim's algorithm to find Minimal spanning tree for the graph
below. [3J[C04]
1J

Figure 2: Pr/m's Algorithm

b) Find the maximum matching for the bipartite graph given

using the Ford-Fulkerson Algorithm. below
[2][C04]

I jj .J .J J
 1/)L_ ~ " .. -
,
e
z

G) 4
C

5 d

• Figure 3: Maximum Bipartite Matching

Q.5.
a) In a computer lab, 50 computer and 75 cables are there. How many
ways can we connect to have the strongest connectivity?

[3][C04]
b) Eight faculty members, denoted by fl; j2, ... , j8, have been invited
to a workshop to discuss seven topics of interest. It is decided that it
would be more efficient to divide these.faculty members into seven
committees of three each, namely P={fl, j2, f3 }, Q={j2, j3, f4},
R={f4, f5, f6}, S={f5, f6, j7}, T={fl, j7, j8}, U={fl, f5,.j7}, V {12,
f5, j8}. If each committee must meet during one of the time period:
9 - 10 am, 10 - 11 am, 11 am - 12 noon, 2 - 3 pm, 3 - 4 pm, 4 - 5pm,
then what is the minimum number of time periods needed for all
seven committees to meet? [2][C04]

Q.6
a) Prove that every tree with at least two vertices is 2-chromatic. Is the
converse true? Explain. [3][C02]
b) How many cut vertices are there in a tree with 20 vertices and 9
leaves. [2][C02]

Q.7 Attempt ANY TWO parts.

a) Find the \ength of an optimal Chinese postman route in the graph
be\ow by showing a\l the steps in the algorithm. Write down one
possib\c route. [S][C03]

3
 Figure 4: Chinese Postman Problem

b) Prove that the following set of instant insanity cubes have no

solution. • [5][C05]

R, G ·y· R
c: B ·y y G R c; R. (~ ·y· ·y c;
R, '{ B c;
-1
B B ( .l B
Figure 5: Instant Insanity Cube

c) Find the maximum flow using Ford Fulkerson Algorithm showing

each step for the network given in the figure below. [5][C02]

Figure 6: Ford-Fulkerson Algorithm