Q. 4 The minimum number of colours required to colour the vertices of a cycle with nn nodes in such a way that no two adjacent nodes have the same colour is
Answer: (D)
Explanation:
Q. 4 The minimum number of colours required to colour the vertices of a cycle with nn nodes in such a way that no two adjacent nodes have the same colour is
Answer: (D)
Explanation:
