Gate Solved

CS-2002 Question Paper With Solutions

Q. 4 The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is

Answer: (D)

Explanation:

Learn More: Gate EE-2019 Question Paper With Solutions

LEAVE A REPLY Cancel reply