Graph Theory

(Model question paper)

(Math-1051)
Section-A
Answer All the Questions: ( 5 x 1 = 5)
1.a) What is the number of edges present in a complete graph having n vertices?
b) The adjacency matrix of the graph is
c) Define circuit & path in a graph.
d) Define a spanning tree and give an example.
e) Draw a binary tree for the algebraic expression [(a*b)+(c*d)].

Section-B
Answer the following: ( 5x5 =25)

UNIT-I
2.Prove that the number of vertices of odd degree in an undirected graph is always even.
(OR)
3. Write short notes on complete graph, Bi-partite graph, complete Bi-partite graph with
examples.
UNIT-II

4. Find the adjacency matrix of the graph

(0R)
5.Find the incidence matrix of the graph

UNIT-III
6.Examine whether the following graph admits an Eulerian path (or circuit )

If so find it.
(OR)
7. Explain the Königsberg bridge problem.

UNIT-IV
8. Explain the Kruskal’s algorithm.
(OR)
9.Using Kruskal’s algorithm, find a minimal spanning tree of the weighted graph shown below

UNIT-V
10. Write a brief note on Pre order, in order and post order traversals.
(OR)

11. Write the expression ( ( x +2 ) ↑3 )∗[ ( y−( 3+ x ) )−5 ]

in (a) Prefix (b) Postfix notation.