(6 pages)

S.No. 377 19 PMA14

(For the candidates admitted from 2019–2020 onwards)

M.Sc. DEGREE EXAMINATION, JANUARY 2022.

Fourth Semester

Mathematics

GRAPH THEORY

Time : Three hours Maximum : 75 marks

PART A — (15 × 1 = 15 marks)

Answer ALL questions.
Choose the correct answers :

1. Two vertices which are incident with a common

edge are called –––––––––––––.
(a) loop
(b) adjacent vertices
(c) adjacent edges
(d) neighbor

2. A graph with single vertex with no edges is called

–––––––––––––.
(a) trivial graph (b) complete graph
(c) bipartite graph (d) star graph
3. A simple graph with n vertices have atmost ______
edges
(a) nn  1 / 2 (b) n  1 / 2
(c) nn  1 / 2 (d) n  1 / 2
4. A vertex v of G is a cut vertex of G if –––––––––––
is disconnects the graph.
(a) vG (b) vG
(c) Gv (d) G v

5. A graph G is r-edge connected if –––––––––––––.

(a)  G   r (b)  G   r
(c)  G   r (d)  G   r

6. Tree is a connected _______ graph

(a) acyclic (b) cyclic
(c) spanning (d) star

7. A trial that traverse every edges of G is called

–––––––––––––.
(a) Euler trial (b) Bernoulli trial
(c) Newton trial (d) Taylor trial

8. A graph is called Hamiltonian if it has a

(a) loop (b) tree
(c) spanning cycle (d) path
2 S.No. 377
9. For any graph G –––––––––––––.
(a)   0 (b)   0

(c)   n (d)   n

10. A graph is 1-colourable if and only if it is

–––––––––––––.
(a) loop (b) tree
(c) partite (d) empty

11. A ____ graph is k-colourable if and only if it is K-

colourable.
(a) loopless (b) tree
(c) spanning cycle (d) path

12. No critical graph has a ––––––––––––– cut.

(a) loopless (b) clique
(c) spanning cycle (d) path

13. A graph is planar if and only if every subdivision

of G is –––––––––––––.
(a) loop (b) clique
(c) planar (d) path

3 S.No. 377
14. In a non separable plane graph other than k1 and
k2 each face is bounded by a –––––––––––––.
(a) cycle (b) loop
(c) path (d) planar

15. Every ––––––––––––– graph is 5-colourable.

(a) loopless (b) clique
(c) spanning cycle (d) path

PART B — (2  5 = 10 marks)

Answer any TWO questions.

16. Show that in any graph the number of vertices of

odd degree is even.

17. If G is a tree then prove that e  v  1

18. Let M be a matching and k be covering such that

M  k , then show that M is maximum matching
and k is a minimum covering.

19. If G is k -critical then prove that f g   k  1 .

20. If the girth k of a connected plane graph is at least

kn  2
3, then show that m  .
k2

4 S.No. 377
[P.T.O.]
 PART C — (5  10 = 50 marks)
Answer ALL questions.

21. (a) If a simple graph G is not connected, then

show that GC is connected.
Or
(b) Write short notes on Incidence and Adjacency
matrices with example.

22. (a) Prove that a graph G with at least 3 vertices

is 2-connected if and only if 2 vertices of G are
connected by at least 2 IDP.
Or
(b) Show that a connected graph is a tree if and
only if every edge is a cut edge.

23. (a) State and prove Hall’s theorem.

Or
(b) If   0 , then       v .

24. (a) State and prove Brook’s theorem.

Or
(b) Show that in a critical graph G , no vertex cut
is a clique.

5 S.No. 377
25. (a) Prove that K5 is non planar.
Or
(b) Show that every planar graph is 6 vertex
colourable.
———————

6 S.No. 377