GATE | CS | 2002 | Discrete Mathematics | Graph Theory | Question 4

Last Updated :
Discuss
Comments

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

2

3

4

n - 2⌊n/2⌋ + 2

This question is part of this quiz :

Top MCQs on Graph Theory in Mathematics,GATE-CS-2002,Topic Wise Quiz on Graph Theory
Tags:
Engineering Mathematics Questions
GATE
Computer Subject
Discrete Mathematics
Share your thoughts in the comments