Part A

Sr. No. Question Correct

Answer

1 In the graph, neighbourhood of vertex ‘e’ is c

(a) N(e)={c,b,f,g}}

(b) N(e)={c,d,e,b,f}

(c) N(e)={c,b,f}

(d) N(e)={c,d,f}

2 The number of edges in a 3-Regular graph with 6 vertices is B

(a) 6

(b) 9

(c) 3

(d) 18

3 Out of following options, the number of odd degree vertices in a graph can be B

(a) 3

(b) 4

(c) 5

(d) 1
4 The number of edges in complete graph 𝐾2,5 is C

(a) 32

(b) 25

(c) 10

(d) 7

5 B
The removal of a cut-vertex from a graph, leads to a subgraph which is

(a) Connected

(b) Disconnected

(c) May not be connected in all the cases

(d) May not be disconnected in all the cases

6 How many edges does a graph have if its degree sequence is 6, 5, 3, 2, 2? B

(a) 5
(b) 9
(c) 4
(d) 18
7 How many edges does a graph have if its degree sequence is 5, 2, 2, 2, 2, 1? B
(a) 5
(b) 7
(c) 4
(d) 14
8 Determine which of the degree sequence is graphic. B

(i) 5, 4, 3, 2, 1, 0
(ii) 5, 3, 3, 3, 3, 3

(a ) Only (i)

(b) Only (ii)

(c) Both (i) and (ii)

(d) None

9 If two graphs are isomorphic then which of the following is not true. c

(a) Two graphs should have same degree sequence

(b) Two graphs should have same number of edges

(c) Two graphs should look same in the diagram

(d) They should have same number of circuits of a given length

10 Which of the following is not true for this graph? D

(a) Graph has no Hamilton path

(b) Graph has no Euler’s path

(c) Graph has neither Hamilton’s path nor Euler’s path

(d) Graph has Euler’s path

11 Chromatic number of 𝐾4,5 is c

(a) 4

(b) 3

(c) 2

(d) 1

12 Which of the following is not true for a tree graph? D

(a) It should be connected

(b) It should be free from circuits

(c) It should have n-1 edges if there are n vertices

(d) It can have a multiple edges

13 Maximum number of leaves in a full 3-ary tree of height 4 can be C

(a) 12 leaves

(b) 64 leaves

(c) 81 leaves

(d) 4 leaves
14 How many edges does a tree with 10,000 vertices have? C
(a) 10000
(b) 10001
(c) 9999
(d) 20000

15 How many vertices does a full 11-ary tree with 200 internal vertices have? b
(a) 211
(b) 2201
(c) 11200
(d) 20011
16 ∑50
𝑖=1 𝑑𝑒𝑔(𝑣𝑖 ) in 𝐾50 is A

(a) 2450 (b) 3450 (c) 1000 (d) 1225

17 Every complete graph with n vertices is planar if __ A

(a) 𝑛≤ 4
(b) 𝑛> 4
(c) 𝑛≤ 5
(d) 𝑛≥1
18 Consider the following statements C
P: Every complete graph with n vertices is (𝑛 − 1) − 𝑅𝑒𝑔𝑢𝑙𝑎𝑟.
Q: Every cycle graph with n vertices is 2-regular. Then

(a) Only P is true

(b) Only Q is true
(c) Both P and Q are true
(d) Neither P nor Q is true
19 Let G be a simple undirected graph with 10 vertices and it’s not a complete one then how many vertices are there in 𝐺̅ (complement graph B
of G)

(a) 5 (b) 10 (c) 25 (d) 0

20 Let G be a simple undirected graph with 10 vertices and 10 edges then how many edges are there in 𝐺̅ B

(a) 45 (b) 35 (c) 25 (d) 50

21 The value of n such that 𝐾𝑛 is isomorphic to 𝐶𝑛 A

(a) 3 (b) 4 (c) 5 (d) 6

22 c
The value of n such that 𝐶𝑛 and ̅̅̅
𝐶𝑛 (Complement graph) has the same no. of edges

(a)3 (b) 4 (c) 5 (d) 6

23 Total number of edges in 𝑊10 d

(a) 5 (b) 10 (c) 15 (d) 20

23 The wheel graph with n vertices is regular if n= c

(a) 5 (b) 4 (c) 3 (d) any natural number

24 The number of vertices in 𝑄3 a

(a) 8 (b) 6 (c) 16 (d) 4

1 ∑150
𝑖=1 𝑑𝑒𝑔𝑟𝑒𝑒(𝑣𝑖 ) in 𝐾50,100 is d

(a) 100 (b) 150 (c)1000 (d)10000

2 The chromatic number of 𝐾10 b

(a) 5 (b) 10 (c) 15 (d) 20

3 The chromatic number of 𝐶100 b

(a) 100 (b) 2 (c) 3 (d) 4

4 How many leaves does a full 3-ary tree with 100 vertices have? A
(a) 67
(b) 103
(c) 300
(d) 97
5 How many edges does a full binary tree with 2020 internal vertices have? b
(a) 2020
(b) 4040
(c) 22020
(d) 1010
6 The chromatic number of 𝑊100 c

(a) 100 (b) 2 (c) 3 (d) 4

7 Consider the following statements c

P: The chromatic number of 𝑄3 is 2
Q: The chromatic number of 𝐾𝑚,𝑛 is 2

Then

(a) Only P is true

(b) Only Q is true
(c) Both P and Q are true
(d) Neither P nor Q is true

8 Consider the following statements c

P: The 𝑄3 is planar
Q: The 𝑊3 is planar
Then
(a) Only P is true
 (b) Only Q is true
(c) Both P and Q are true
(d) Neither P nor Q is true

9 The number of bounded regions in 𝐶𝑛 and 𝑊𝑛 respectively b

(a) 2, n+1 (b) 1, n (c) n, n (d) 2,n

10 Which one the following graph is non-planar. c

(𝑎) 𝐶5 (b) 𝑊5 (c) 𝐾6 (d) 𝐾2,3

11 Consider the following statements c

P: Every cycle graph has a Euler path Q: Every cycle graph has a Hamiltonian path
Then
(a) Only P is true (b) Only Q is true
(c) Both P and Q are true (d) Neither P nor Q is true

12 The weight of minimal spanning tree is C

(a) 15
(b) 13
(c) 14
(d) 12
13 Which one is a
Incorrect
representation T1 T2
of Binary
Search tree?

(a) Only
T1
(b) Only
T2
(c) Both
T1
and
T2
(d) None