Scribd
Upload
41 views4 pages

16smbemm2-1-Apr 2020

This document contains a university exam on graph theory. It has three parts - Part A contains 10 short answer questions defining graph theory terms. Part B has 5 longer proof questions. Part C requires answering 3 out of 5 longer questions on specific graph theory topics like isomorphism and Euler's formula.

Uploaded by

esanjai510
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views4 pages

16smbemm2-1-Apr 2020

This document contains a university exam on graph theory. It has three parts - Part A contains 10 short answer questions defining graph theory terms. Part B has 5 longer proof questions. Part C requires answering 3 out of 5 longer questions on specific graph theory topics like isomorphism and Euler's formula.

Uploaded by

esanjai510
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

S.No.

15640 TC 16 SMBEMM 2 : 1

(For candidates admitted from 2016-2017 onwards)

B.Sc. DEGREE EXAMINATION, APRIL 2020.

Part III — Mathematics — Major Based Elective

GRAPH THEORY

Time : Three hours Maximum : 75 marks

PART A — (10 × 2 = 20)

Answer ALL questions.

1.
Give two examples for a regular graph of degree 3.

2.
Define a bipartite graph with an example.

3.
Define connected graph with an example.

4.
Define bridge with an example.

5. K5

Find three spanning trees of K 5 .

6.
Define Hamiltonian cycle.

7.
State Kuratowski’s theorem.

8. K5 e

Show that K5 e is a planar graph.

9.
Define out degree with an example.
10.
Define weighted graph.

PART B — (5 5 = 25)

Answer ALL questions, choosing either (a) or (b).

11. 4n 4n 1
Prove that any self complementary graph has 4n or 4n 1 points.

Or

Prove that in any graph G, the number of points of odd degree is even.

12. k G k

Prove that if k , then G has a path of length k .

Or

G G

Prove that if every point of G has even degree then the set of edges of G can
be partitioned into cycles, where G is a connected graph.

13. G( p, q) p q 1 G

If G( p, q) is connected and p q 1 , then prove that G is acyclic.

Or
(i)
(ii)

(i) Define closure of a graph.


(ii) Prove that a graph is Hamiltonian iff its closure is Hamiltonian.
np 2
14. G p, q n q
n 2

If G in a p, q plane graph in which every face is an n cycle then prove that


np 2
q .
n 2
2 S.No. 15640 TC
Or
K5

Prove that K 5 is non-planar.


15.

Prove that if two digraphs are isomorphic then the corresponding point have
the same degree pair.
Or
v1 , v2 , v3 , v4 , v5 v6

[P.T.O.]
0 1 3 13 2 8
1 0 8 9 2
3 8 0 12
13 9 0 10 7
2 2 12 10 0 12
8 7 12 0
Find a minimum weight spanning tree when the distance between the points
v1 , v2 , v3 , v4 , v5 and v6 are as follows :

0 1 3 13 2 8
1 0 8 9 2
3 8 0 12
13 9 0 10 7
2 2 12 10 0 12
8 7 12 0

PART C — (3 10 = 30 marks)
Answer any THREE questions.

16.

(a) Show that in any group of two or more people, there are always two with
exactly the same number of friends inside the group.
(b) Explain isomorphism and non-isomorphism of graph.

3 S.No. 15640 TC
17. G1 p1 , q1 G2 p2 , q2

G1 G2 p1 p2 , q1 q2 p1 p2

G1 G2 p1 p2 , q1 p2 q2 p1

G1 G2 p1 p2 , q2 p1 q1 p22

Let G1 be a p1 , q1 graph and G2 be a p2 , q2 graph. Then prove that


(a) G1 G2 is a p1 p2 , q1 q2 p1 p2 graph.

(b) G1 G2 is a p1 p2 , q1 p2 q2 p1 graph.

(c) G1 G2 is a p1 p2 , q2 p1 q1 p22 graph.

18.
State and prove Dirac’s theorem.

19.
State and prove Euler formula for planar graphs.

20. A

Find the shortest distance from vertex A to all vertices in the following weighted
graph.

_________________
4 S.No. 15640 TC

You might also like