S.No.

5153 MMAL

(For the candidates admitted from 2007-2008 onwards)

M.Sc. DEGREE EXAMINATION, MAY 2021.

Second Year — Non-Semester

Mathematics

DISCRETE MATHEMATICS AND GRAPH THEORY

Time : Three hours Maximum : 100 marks

SECTION A — (5  5 = 25 marks)

Answer ALL the questions

1. (a) Show that P  Q   P  Q  R   P  Q   P  R  is a

tautology. (Set 1).

Or

(b) Obtain Disjunctive Normal form of P  Q  P Q .

2. (a) Symbolize the expressions “All the world loves a lover”.

Or

(b) Show that x H x   M x   H S   M S   97  .

3. (a) Define Lattices, Sublattices, Direct product and Homomorphism in

algebraic systems.

Or

(b) Write the following Boolean expressions in an equivalent sum-of-product

canonical form in three variables x1 , x 2 and x3 : (i) x1  x 2 (ii) x1  x 2 and

(iii) x1  x 2   x3 .

4. (a) Show that the number of vertices of off degree is always even.

Or

(b) Discuss about the isomorphism and non isomorphism.

5. (a) In a graph G , if there is one and only one path between every pair of
vertices, then show that G is a tree.

Or
(b) Prove that the maximum flow possible between two vertices ‘a’ and ‘b’ in
a network is equal to the maximum of the capacities of all cutsets with
respect to a and b.

SECTION B — (5  15 = 75 marks)

Answer ALL the questions.

6. (a) (i) Construct the truth table for P  Q   P and P  P  Q 

(ii) Show that P  Q  R   Q  R   P  R   R .

Or
(b) (i) Obtain the principal disjunctive normal form of P  Q and
P  Q   P  R   Q  R  .
(ii) Show that P  P  Q   P .

7. (a) Show without constricting truth table that the following statements
cannot all be true simultaneously R  M R  S M S .

Or
(b) (i) Show that x M x  follows logically from the premises
x H x   M x  and x H x  .
(ii) Prove that x P x   Q x   x P x   x Q x 

8. (a) Let L,   be a lattice, for any a, b, c,  L , prove that

 a b  a c
(i) bc
a  b  a  c
(ii) a  b  a b  a  a  b  b .

Or
(b) (i) Show that
    
x1  x '2 x '3 x '4  x1  x '2 x '3 x 4  x1  x '2 x3  x 4  
x
1  x '2 x3  x'   x
4 1  x '2

(ii) Obtain the Product-of-sums canonical forms of the Boolean

expressions in three variables x1 , x 2 and x3 : (1) x1  x 2 (2) x1  x2

2 S.No. 5153
9. (a) Prove that a give connected graph G is an Euler graph if and only if all
vertices of G are of even degree.

Or
(b) Prove that a simple graph with n -vertices and k -components can have
atmost
n  k n  k  1 edges.
2

10. (a) State and prove Cayley’s theorem on counting trees.

Or
(b) Show that a tree with n vertices has n  1 edges.

——–––––––––

3 S.No. 5153