(8 pages)

S.No. 4265 19PMA14

(For the candidates admitted from 2019-2020 onwards)

M.Sc. DEGREE EXAMINATION, APRIL/MAY 2021

Fourth Semester

Mathematics

GRAPH THEORY

Time : Three hours Maximum : 75 marks

PART A — (15  1 = 15 marks)

Answer ALL questions.

1. A set of two or more edges of a graph G is called

____ if they the same pair of distinct ends.
(a) Parallel edges (b) Adjacent
(c) Simple (d) Unordered pair

2. A simple graph with n vertices can have at most

______ edges.
n(n  1) n
(a) (b)
2 2
n 1 n(n  1)
(c) (d)
2 2
3. A graph G is called k -regular if every vertex of
G has degree

(a) K (b) K–1

(c) K2 (d) 0

4. If G is trivial, then the vertex connectivity k(G ) is

(a) 0 (b) 1

(c) 2 (d) 4

5. A graph G is r – connected, if

(a) k(G )  r (b) k(G )  r

(c) k(G )  r (d) k(G )  r

6. Let G be a connected graph. Then the diameter of

G is defined as

(a) min d(u, v) ; u, v  V (G )

(b) max d(u, v) ; u, v  V (G )

(c) min d(u, v ) ; u  V (G )

(d) max d(u, v) ; u  V (G )

2 S.No. 4265
7. A subset K of V is called a covering of G if

(a) Every edge of G is incident with at least one

vertex of K.

(b) Every edge of G is incident with atmost one

vertex of K.

(c) Every edge of G is incident with no vertex

of K.

(d) Every edge of G is incident with at least two

vertex of K.

8. An M-alternating path in G is a path whose edges

alternate between

(a) E and M (b) E \ M and E

(c) E \ M and M (d) M \ M and M

9. Königsberg bridge problems has

(a) More than one solution

(b) No solution

(c) Unique solution

(d) Exactly two solutions

3 S.No. 4265
10. The chromatic number of a graph G is the

(a) Maximum number of colors needed for a

proper vertex coloring of G

(b) Minimum number of colors needed for a

proper vertex coloring of G

(c) Total colors needed for a proper vertex

coloring of G

(d) Approximate number of colors needed for a

proper vertex coloring of G.

11. For any graph G, we have

(a)  (G )  1  (G ) (b)  (G )  1  (G )

(c)  (G )  1  (G ) (d)  (G )  1  (G )

12. A graph G is said to be a class 1 graph if

(a) '  1   (b)  '  

(c) '  1   (d) '  

4 S.No. 4265
[P.T.O]
13. Which of the following is the Euler’s formula.

(a) For a connected plane graph G, we have

n  m  f  2 , where n, m and f denote the
number of vertices, edges and faces of G,
respectively.

(b) For a connected plane graph G, we have

n  m  f  0 , where n, m and f denote the
number of vertices, edges and faces of G,
respectively

(c) For a connected plane graph G, we have

n  m  f  2 , where n, m and f denote the
number of vertices, edges and faces of G,
respectively

(d) For a connected plane graph G, we have

n  m  f  2 , where n, m and f denote the
number of vertices, edges and faces of G,
respectively

14. Heawoods five-color theorem is

(a) Every planar graph is 5- vertexcolorable

(b) Every graph is 5- vertexcolorable

(c) Every planar graph is 6- vertexcolorable

(d) Every graph is 6- vertexcolorable

5 S.No. 4265
15. A plane graph G is called self-dual if

(a) G is not isomorphic to G*

(b) ~ G*
G

(c) G G*

(d) ~G
G

PART B — (2  5 = 10 marks)

Answer any TWO questions.

16. State and prove Euler’s theorem.

17. Prove that a vertex v of a connected graph G with

at least three vertices is a cut vertex of G if and
only if there exist vertices u and w of G distinct
from v such that v is in every u  w path in G.

18. Prove that a graph is Eulerian if and only if it has

an odd number of cycle decompositions.

19. If G is k-critical, then prove that  (G )  k  1 .

20. Prove that a graph is planar if and only if it is

embeddable on a sphere.

6 S.No. 4265
 PART C — (5  10 = 50 marks)
Answer ALL questions.
n 1
21. (a) If G is simple and   , then prove that
2
G is connected.
Or
(b) Prove that every tournament contains a
directed Hamilton path.
22. (a) For any loopless connected graph G, prove
that k(G )   (G )   (G ) .
Or
(b) Prove that the number of edges in a tree on
n vertices is n  1 . Conversely, a connected
graph on n vertices and n  1 edges is a tree.
23. (a) Define the following:
(i) A matching in G.
(ii) An edge covering of G.
(iii) An M-augmenting path in G.
(iv) Euler tour.
(v) Hamiltonian cycle.
Or
(b) Prove with the usual notation that for any
graph G for which   0 , '   '  n

7 S.No. 4265
24. (a) If G a bipartite graph, then prove that
 ' (G )  (G ) .

Or
(b) Find the chromatic polynomial f (C4 ;  )
with graphical illustration.

25. (a) Prove that a graph G is planar if and only if

each of its blocks is planar.

Or
(b) Prove that K 5 is nonplanar.

——–––––––––

8 S.No. 4265