C. U., M. Sc. Sem.

3, 2021

M.Sc. Semester 3 Examination, 2021

PURE MATHEMATICS

Paper : PM 3/E1/108
(Advanced Graph Theory I)

Full Marks : 50

The figures in the margin indicate full marks.

(Notations have usual meanings.)

Answer all questions

Section I

All are multiple choice questions with single correct option.

In this section, candidates are required to justify the correct choice only in their own words
as far as practicable.

1. Which of the following is true?

A. Genus of a nonplanar graph G is equal to the crossing number of G.

B. Every maximal planar graph is Hamiltonian.
C. K5 has no abstract dual but has geometric dual.
D. The genus of K7 , γ(K7 ) = 1.

Justify your choice. 1+4

2. Let G be a k-critical graph for k ≥ 3 such that G − v is (k − 1)-critical. Then which of the
following is true?

A. G is an odd cycle C2n+1 , (n ≥ 1).

B. G is a complete graph Kn (n ≥ 3).
C. G is the Mycielski graph Mk (k ≥ 3).
D. G is all of the above three graphs.

Justify your choice. 1+4

3. Let G be a self dual graph with n vertices and e edges. Then which of the following is true?

A. 2e = n + 2.
B. 2n − 2 = e.
C. 2e = n − 2.
D. 2n = 2e + 1.

Justify your choice. 1+4

1
 C. U., M. Sc. Sem. 3, 2021

4. Which of the following is true for a graph G?

A. The graph G = K2 K3 is not Hamiltonian.

B. If the closure of G is not complete, then G is not Hamiltonian.
C. The Petersen graph G is Hamiltonian.
D. The graph K4 C3 is Hamiltonian.

Justify your choice. 1+4

Section II

All are multiple choice questions which may have multiple correct options.
In this section, candidates are required to say TRUE or FALSE for each of the four options
corresponding to a question and justify all the TRUE options only using their own words as
far as practicable.

5. Which of the following is/are true?

A. For every integer x, the sequence 7, 6, 3, 3, 3, 2, 1, x (0 ≤ x ≤ 7) is not graphical.

B. For Petersen graph, the vertex connectivity κ(G) and edge connectivity λ(G) are equal.
C. A graph of order n ≥ 3 and size m ≥ n−1


2 + 2 is Hamiltonian.
D. If T be any tree of order n ≥ 4, then the complement of T contains a Hamiltonian path.

Justify all the choices which are TRUE. 4+6

6. Which of the following is/are true?

A. If G is a connected graph of order n and P (G, λ) = λ(λ − 1)n−1 , then G is a tree.

B. Two tree of small order need not be chromatically equivalent.
C. The polynomial λ5 − 4λ4 + 6λ3 − 4λ2 is a chromatic polynomial of some graph.
D. For any connected graph G of order n and diameter d, χ(G) ≤ n − d + 1.

Justify all the choices which are TRUE. 4+6

7. Let G = (V, E) be a connected graph, then which of the following is/are true?

A. If G has exactly two vertices that are not cut vertices, then G is a path.
B. Every pendant vertex of some spanning tree of G is a cut vertex.
C. Every pendant vertex of some spanning tree of G is not a cut vertex.
D. For v ∈ V , v may be a cot vertex of G and G.

Justify all the choices which are TRUE. 4+6