For More Question Papers Visit - http://pediawikiblog.blogspot.

com

USN

I I I I I I I I I I I
Fourth Semester B.E. Degree Examination, June 2012 Graph Theory and Combinatorics

06CS42

Tim e : 3 hrs .

Max. Ma rk s :lOO

Note: An swer FIVE full questions, selecting at least TWO questions from each part.
1

a. b.

c. 2

PART- A S how that the max number of edges in a s imple gra ph w ith n ve rtices is n(n - I )/2 (06 M arks) How ma ny ve 1tices will the fo llow ing graphs have if they contain : i) 16 edges and all ve1tices o f degree 4 . i i) 12 edges, 6 ve rtices of deg ree 3. and o the r ve1tices of degree less than 3. (08 Marks) Prove th at numbe r o f ve rt ices of o dd degree in a g raph is even. (06 Marks)

a . Dete rmine the num ber of ve 1tices. numbe r of edges and the numbe r of reg io ns fo r each o f the p la nar gra ph in the Fig.Q.2(a )(i) and Fig.Q.2(a)( ii) and also verify tha t E ulers theo re m fo r connected plana r graph is satisfied. (06 Marks)

b.

Fig.Q.2(a)( i) F ig.Q .2(a)( i i) F ind a H amilton cycle, if ex ists, for each of the graph s shown in Fig.Q.2(b )(i) and F ig.Q.2(b)(ii ). If g raph has no Hamil ton cyc le, dete rm ine w hethe r it has a Ha milton path .
(06 Ma rks)
0...

b
~

c.

.
(..

a.
h

\>

c.

Fig.Q.2( b)(i) Fig.Q.2( b )( ii) De te 1 mine the chromatic polyno mi als P(G ,~> A.) and chromatic numbe rs of each of the fo llow in g g raphs Fig .Q.2(c)( i) and Fig.Q.2(c)( ii ).

l.V ')t

"'I

").

Fig.Q.2(c)(i)

Fig .Q .2(c)(ii )

a.

S ho w that for eve ry tree T

=(V, E) if lVI ~ 2 ,

the n T has at least two pe nde nt ve rtices.

(04 Ma rks)

For More Question Papers Visit - http://pediawikiblog.blogspot.com

For More Question Papers Visit - http://pediawikiblog.blogspot.com

06CS42
b. Suppose that a tree T has two vertices of degree 2, four vert ices of degree 3 and three vertices of degree 4. Find the number of pendent ve1tices in T. (06 Marks ) c. What is a prefix code? Construct an optimal prefix code for the symbols a, b, c, . . .. i, j that occur in a given sample with respect to frequencies 78 , 16, 30, 35, 125, 3 1, 20. 50, 80, 03.
(10 Marks )

a. b.

c.

Explain Prim 's algorithm for finding shortest spanning tree of a weighted graph. (08 Marks) Define the following with respect to bipartite graph G = (V, E) : i) Complete matching ; ii) Maximal matcing ii ) Defici ency of graph G. (06 Marks) Define : i) Cutset; ii ) Edge -connectivity; iii ) Ye1tex - connectiv ity with one example for (06 Marks) each.

a. b.

c.

PART-B State two basic counting principles . Give on example for each. (06 Marks) A committee of 4 is to be chosen out of 6 Englishman, 5 Frenchmen and 4 Ind ians, the comm ittee is to con tain one of each nationality i) In how many ways can it be done? ii ) In how many arrangements will a pa1ticular Indian be? (08 Marks) Consider the following program segment, where i,j and k are integer variables for i : = I to 20 do for j : = I to i do for k : = I to j do print(i * j + k). Dete1mine how many times the print( ) statement is executed in above program. (06 Marks)

In how many ways can these integers I, 2, 3, .. ... , 10 be arranged in a line so that no even integer is in its natural position. (06 Marks) b. Determine the number of positive integers n where I ::; n ::; I 00 and n is not di visible by 2, 3, or 5. (08 Marks) c. A board consists of the shaded part as in the Fig.Q.6(c ). Find its Rook polynomial. (06 Marks)

a.

W/}1 l!jj

(/~
Fig.Q.6(c)

(/II! I;/;

r~r{Z
(08 Marks)

(x - 3)(x-2/ b. Find the generating function for each of the following sequence : 0, 2, 6, 12, 20, 30, 42, ... .. . i) ii) 8, 26, 54, 92, ..... .. (06 Marks) c. Find a formu la to express 0 2 + 12 + 2 2 + ..... + n2 as a function of n, using summation operator. (06 Marks) a. Solve the relation Fn+2 = Fn+l + F 11 , where n ~ 0 and Fo = 0, F 1= I. (06 Marks) b. Using generating function, so lve Yn+2 - 4Yn+l + 3yn = 0 g iven that yo = 2, y, = 4. (08 Marks) c . Findthegenerated solution of S(K) - 3S(K - I )-4S(K-2) = 4K where K~2 .
(06 Marks)

a.

Determine the coefficient of x8 in

**** *

For More Question Papers Visit - http://pediawikiblog.blogspot.com