Continuous Assessment Test I August 2015

Course

: MAT 503 Higher Mathematics

Class NBR

: 5138

Time

: 1.5 Hrs

Slot : F2 + TF2

Max.Marks : 50

I Answer ALL Questions

(5 X 10 = 50)

1.
a. Show that the total number of odd degree vertices of a (p, q) graph is
always even.
b. Draw a cyclic graph which is isomorphic to its complement
c. Explain a regular graph with an example.

(4)
(4)
(2)

a. Show that the following graphs G & H are ismorphic

(7)

2.
V5 1
V2

V4 1

V3 1

V5
V1
V3
G

V4

V1 1

V2 1
H

b. Draw a graph which is Hamiltonian but not Eulerian.

3.

(3)

a. Show that any connected graph with n vertices and n-1 edges is a tree.
(5)

b. Prove that in a connected graph G, any minimal set of edges containing at

least one brach of every spanning tree of G is a cut-set.
(5)
4.
a. Explain the circuit matrix of a graph. Write the circuit matrix for the
following graph.

(5)

V3
V6
V2

V4

V1

V5

b. Find the minimal spanning tree using Kruskals algorithm.

a

9
8

4
2

10

11

(5)

14

3
g

5.
a. Explain Markov Processes.
b. Derive the Probabilty law of Poission process.

(3)
(7)