DISCRETE MATHEMATICS II B.C.A Sem 2 18-21 Feb 2019

SAINTGITS COLLEGE OF APPLIED SCIENCES

First Internal Assessment Examination, FEB 2019

Department of  Mathematics, Semester 2

DISCRETE MATHEMATICS II

                                                                              

Section A

1. Graph G = (V, E) consists of non empty set V of vertices and a set E of edges. Any example

2. 15

3. A graph is connected if there is a path between any 2 distinct vertices. Any example

4. Yes.

5.

6. Connected undirected graph with no simple circuit. Any example

                                                                                               

                                                                        Section B

Short essay questions

Answer any 5 questions. Each question carries 5 marks.

7. Give any 2 graph models

8. Give proof taking 2 distinct vertices

9. 0010

    0012

   1101

   0210

10. Give proof

11. Prove both parts

12. 11

Section C

Long essay questions

Answer any 1question. It carries 15marks.

13. a) Two simple graphs are isomorphic if there is a one to one and onto function between the vertex   

         sets which preserves adjacency

         The graphs are not isomorphic because G has 4 vertices of degree 3 and 1 vertex of degree 2, but

          H has 2 vertices of degree2, 2 vertices of degree 3 and 1 vertex of degree 4

     b) Write steps of the procedure

14. a) G – Not tree, H – Tree

      b) Write proof

_____________________