Q. 60 The minimum number of colour required to colour the following graph, such that
no two adjacent vertices are assigned the same colour, is
(A) 2
(B) 3
(C) 4
(D) 5
Answer: (C)
Explanation:
Q. 60 The minimum number of colour required to colour the following graph, such that
no two adjacent vertices are assigned the same colour, is
(A) 2
(B) 3
(C) 4
(D) 5
Answer: (C)
Explanation:
