Sybsc-Cs Sem3 CGT Apr18

You might also like

You are on page 1of 3

5 D

15 F53 32C 08D 829 995 9B7 71E3 336 5BB B7B
F 0 9 5
5F 532 2C0 8D8 8299 959 B71 1E33 365 BB7 7B1 16D
5 8 B B 5
F5 32C C08 D82 2995 59B 71E E336 65B B7B B16 6D5 15F
32 08 D8 99 9B 71 33 5B B7 1 D5 15F 53
32 C08 D8 299 59B 71 E33 65B B7 B1 6D5 15F 53 2C0
C E 6 2
2C 08DD82 2995 59B 71E 336 65B B7B B16 D51 15F 532 C08 8D8
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29
08 D82 99 59B 71E 33 65B B7 B16 D5 15F 532 C0 8D8 29 959
D 5 6 B 1 8 9 B
8D 829 995 9B7 71E3 336 5BB B7B 16DD51 5F5 532C C08 D82 299 59B 71E
8 9 9 B 1 3 5 7 1 5 3 0 D 9 5

(c)

(a)
(a)

(b)
(b)
N.B.
D8 299 59 71 E33 65 BB7 B1 6D 515 F53 2C 8D 829 95 9B7 71E3 336
2 B E B 6 5 F 2 0 8 9 1 5

Q. 2
Q. 1
82 995 59B7 71E 336 65B B7B B16 D51 15F5 532 C08 8D8 299 959B B71 E33 365B BB7
99 9B 1E 33 5B B7 16 D5 5F 32 C0 D 29 59 71 E3 65 B B1
29 59 71 3 65 B B1 D 15 53 C 8D 82 95 B7 E 36 BB 7B 6D
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82

n
B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B
51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71
5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3

(a) 3
53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B

Short Answers
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B

(a) Series

expansion.
Fill in the blanks
29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5

2. 𝐶0 =_______
by________.
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15

4. Planar graph
1. Combination

(a) Begins with 1


71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5

3. Regular graph
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
(b) 2

5. Augmenting path
2. Binomial theorem
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D

arriving at the sink.


B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82
1) All questions are compulsory.

B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99


6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B

(a) simple (b) pseudo


Attempt All (Each of 5Marks)
(2 ½ Hours)

51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71


5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3
2) Figures to the right indicate marks.

(a) Pendant (b) isolated


53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36 (b) sequence
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B
4) Mixing of sub-questions is not allowed.

D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B

(b) Begins with 1 and ends with 0


Attempt the following (Any THREE)
29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D

Page 1 of 3
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15

( Pascal triangle, n, trail, equal, one)


(c) 6

71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5


Select correct answer from the following:

E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
(c) line

(a) increase (b) decrease (c) equal


5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82 (c) multiple
B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B
51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71

D515F532C08D829959B71E3365BB7B16
3. A vertex with degree one is called _________

5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3

For the binary strings of length 10, how many of them


53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B
(d) 10
2. String is the_____________ of characters or symbols
S0133 / S2006 / COMBINATORICS & GRAPH THEORY

29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D


95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15

Determine the coefficient of x2y2z2 in the expansion of (x + y+ z)6.


3) Illustrations, in-depth answers and diagrams will be appreciated.

71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5


E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
1. The___________ is used to find the coefficients in binomial
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
5. Augmenting path is used to _______ the value of a network flow.

5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82

4. Chromatic number of complete graph with n vertices is______.


B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
(d) arrangement

6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 5


(d) none of the above

51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59

3. The walk in which no edges is repeated more than one is called___


(c) incident (d) none of the above

5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59
[Total Marks: 75]

5. In network the amount of leaving the source is _____ to the amount


1. The product of two consecutive natural number is always divisible

(d) none of the above


4. A graph with no parallel edges and no loops is called a_______ graph.

53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 7
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7
29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E
Q. P. Code: 19835

95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3

(15M)
(15M)

71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 3


E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33
5B 7 16 5 5F 32 0 D8 99 59 71 3 65
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365
B1 6D 15 53 2C 8D 829 95 B7 1E 36 B
6D 515 F5 2C 08D 82 95 9B 1E 336 5B
51 F5 32C 08 82 99 9B 71E 33 5B B7
5F 32 0 D8 99 59 71 33 65 B7
53 C0 8D 29 59 B7 E3 65 BB B
2 8 9 1
5 D
15 F53 32C 08D 829 995 9B7 71E3 336 5BB B7B
F 0 9 5
5F 532 2C0 8D8 8299 959 B71 1E33 365 BB7 7B1 16D
5 8 B B 5
F5 32C C08 D82 2995 59B 71E E336 65B B7B B16 6D5 15F
32 08 D8 99 9B 71 33 5B B7 1 D5 15F 53
32 C08 D8 299 59B 71 E33 65B B7 B1 6D5 15F 53 2C0
C E 6 2
2C 08DD82 2995 59B 71E 336 65B B7B B16 D51 15F 532 C08 8D8
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29
08 D82 99 59B 71E 33 65B B7 B16 D5 15F 532 C0 8D8 29 959
D 5 6 B 1 8 9 B
8D 829 995 9B7 71E3 336 5BB B7B 16DD51 5F5 532C C08 D82 299 59B 71E
8 9 9 B 1 3 5 7 1 5 3 0 D 9 5

(f)
(f)

(c)
(c)

(e)
(e)

(a)
(a)

(b)

(d)
(d)
D8 299 59 71 E33 65 BB7 B1 6D 515 F53 2C 8D 829 95 9B7 71E3 336
2 B E B 6 5 F 2 0 8 9 1 5

Q. 4
Q. 3
82 995 59B7 71E 336 65B B7B B16 D51 15F5 532 C08 8D8 299 959B B71 E33 365B BB7
99 9B 1E 33 5B B7 16 D5 5F 32 C0 D 29 59 71 E3 65 B B1
29 59 71 3 65 B B1 D 15 53 C 8D 82 95 B7 E 36 BB 7B 6D
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5

9}
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32

𝑛
0
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82
B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B
𝑛
1
51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71
5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3
53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B

and justify it.


08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B 2
𝑛
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B

following graph.
29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
For each n >0 , prove that

B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82


B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B
X1 +x2 + x3 + x4 + x5 = 72 , all xi ≥ 0

51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71


5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3
𝑛
𝑛

53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B

Explain Matching in Bipartite graphs.


Attempt the following (Any THREE)
Attempt the following (Any THREE)
( ) − ( ) + ( ) − ⋯ + (−1)𝑛 ( ) = 0

29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D

Page 2 of 3
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32

Explain the colouring of vertices in a graph.


Show that following graphs are isomorphic.

36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0


5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
How Combinatorics is useful in graph theory?

B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82


B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B
Prove by first principle of mathematical induction.

51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71

D515F532C08D829959B71E3365BB7B16
5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3
53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B
S0133 / S2006 / COMBINATORICS & GRAPH THEORY

29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D


95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
How many integer- valued solutions are there for the equation

E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82

set {1, 2, 3, 4, 5, 6, 7, 8} are chosen, then two of them will add up to 9.


For any positive integer n, the sum of the first n positive integers is

B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99


6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 5
2

51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59


5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59
𝑛(𝑛+1)

Draw a tree whose prufer(T) = 6643143 with vertex set {1, 2, 3, 4, 5, 6, 7, 8,

Define adjacency matrix in a graph also find the adjacency matrix of the
,

State pigeon hole principle and Show that if any five numbers from the

Give an example of graph which is both Eulerian and Hamiltonian


53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 7
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7
29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E

(15)
Q. P. Code: 19835

95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3
(15M)

71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 3


E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33
5B 7 16 5 5F 32 0 D8 99 59 71 3 65
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365
B1 6D 15 53 2C 8D 829 95 B7 1E 36 B
6D 515 F5 2C 08D 82 95 9B 1E 336 5B
51 F5 32C 08 82 99 9B 71E 33 5B B7
5F 32 0 D8 99 59 71 33 65 B7
53 C0 8D 29 59 B7 E3 65 BB B
2 8 9 1
5 D
15 F53 32C 08D 829 995 9B7 71E3 336 5BB B7B
F 0 9 5
5F 532 2C0 8D8 8299 959 B71 1E33 365 BB7 7B1 16D
5 8 B B 5
F5 32C C08 D82 2995 59B 71E E336 65B B7B B16 6D5 15F
32 08 D8 99 9B 71 33 5B B7 1 D5 15F 53
32 C08 D8 299 59B 71 E33 65B B7 B1 6D5 15F 53 2C0
C E 6 2
2C 08DD82 2995 59B 71E 336 65B B7B B16 D51 15F 532 C08 8D8
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29
08 D82 99 59B 71E 33 65B B7 B16 D5 15F 532 C0 8D8 29 959
D 5 6 B 1 8 9 B
8D 829 995 9B7 71E3 336 5BB B7B 16DD51 5F5 532C C08 D82 299 59B 71E
8 9 9 B 1 3 5 7 1 5 3 0 D 9 5

(f)

(c)
(c)

(e)
(e)

(a)

(b)
(b)

(d)
(d)
D8 299 59 71 E33 65 BB7 B1 6D 515 F53 2C 8D 829 95 9B7 71E3 336
2 B E B 6 5 F 2 0 8 9 1 5

Q. 5
82 995 59B7 71E 336 65B B7B B16 D51 15F5 532 C08 8D8 299 959B B71 E33 365B BB7
99 9B 1E 33 5B B7 16 D5 5F 32 C0 D 29 59 71 E3 65 B B1
29 59 71 3 65 B B1 D 15 53 C 8D 82 95 B7 E 36 BB 7B 6D
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32

3
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0

B
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D

A
𝜋1 =(
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82

graph.
B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B
5

4
51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71

7
5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3

2
53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36

2
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B

425631
123456
g
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B
b

29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D

3
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5

C
D
-
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15

Explain flows and cuts.


71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
-5
-5

E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0

) , 𝜋1 = (
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D

State Burnside’s theorem.


B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82

2
B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B
5

51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71


5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3
4

E
53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36
6

2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B

561342
123456
)
transformations for fixed colouring.
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B

Define Chromatic number with example.

5
Attempt the following (Any THREE)
29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D

Page 3 of 3
95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15

*************
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 compute 𝜋1 𝜋2 (product of two permutations)
-
-
-

H
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D
Explain Ford- Fulkerson’s labelling algorithm.
Find maximum flow of the following network.
d

h
2

B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82


B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 59B

many of these arrangements have no adjacent A’s?


6

51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59 71

D515F532C08D829959B71E3365BB7B16
5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59 B7 E3
53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B 1E 36
5

4
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 71 33 5B
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71 E3 65 B
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7 E3 36 BB 7B
S0133 / S2006 / COMBINATORICS & GRAPH THEORY

29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E 36 5BB 7B 16D


z

95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E 33 5B 7 16 5
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3 65 B B1 D 15

G
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 365 BB 7B 6D 515 F5
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36 B 7B 16 51 F 32
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0
5B 7 16 5 5F 32 0 D8 99 59 71 3 65 B B1 D 15 53 C 8D

State first principle and second principle of mathematical induction


B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365 BB 7B 6D 515 F5 2C 08D 82
B1 6D 15 53 2C 8D 829 95 B7 1E 36 BB 7B 16D 51 F5 32C 08 82 99
6D 515 F5 2C 08D 82 95 9B 1E 336 5B 7B 16 51 5F 32 08 D8 99 5
51 F5 32C 08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 299 59
5F 32 0 D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 59
Draw all the possible pattern of colouring also find the different

In how many ways can we arrange the letters in TALLAHASSEE? How

Find the minimum spanning tree using Kruskal’s algorithm for the given
Suppose we are colouring the vertices of the square using black and white.

Write permutations shown below in cycle notation of 𝜋1 𝑎𝑛𝑑 𝜋2 also

53 C0 8D 29 59 B7 E3 65 BB B 6D 515 F5 2C 08D 82 95 B
2C 8D 82 95 B 1E 36 B 7B 16 51 F 32 08 8 99 9B 7
08 82 99 9B 71E 33 5B B7 16 D5 5F 532 C0 D8 29 59 71
D8 99 59 71 33 65 B7 B1 D 15 53 C 8D 29 95 B7
29 59 B71 E3 65 BB B1 6D 515 F53 2C 08D 82 95 9B7 1E
(15)
Q. P. Code: 19835

95 B7 E 36 BB 7B 6D 51 F5 2C 08 8 99 9B 1E
9B 1E 33 5B 7 16 5 5F 32 0 D8 29 59 71 3
71 33 65B B7 B1 D5 15F 53 C0 8D 29 959 B7 E3 3
E3 65 B B 6D 15 5 2C 8D 82 95 B 1E 36
36 BB 7B 16D 51 F5 32C 08 82 99 9B 71E 33
5B 7 16 5 5F 32 0 D8 99 59 71 3 65
B7 B1 D5 15F 53 C0 8D 29 59 B7 E3 365
B1 6D 15 53 2C 8D 829 95 B7 1E 36 B
6D 515 F5 2C 08D 82 95 9B 1E 336 5B
51 F5 32C 08 82 99 9B 71E 33 5B B7
5F 32 0 D8 99 59 71 33 65 B7
53 C0 8D 29 59 B7 E3 65 BB B
2 8 9 1

You might also like