## Discussion Forum

Que. | 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 |

a. | 2 |

b. | 3 |

c. | 4 |

d. | n - 2⌊n/2⌋ + 2 |

Answer:n - 2⌊n/2⌋ + 2 |

Que. | 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 |

a. | 2 |

b. | 3 |

c. | 4 |

d. | n - 2⌊n/2⌋ + 2 |

Answer:n - 2⌊n/2⌋ + 2 |

Questions from Previous year GATE question papers

UGC NET Previous year questions and practice sets

UGC NET Previous year questions and practice sets

Attempt a small test to analyze your preparation level. This GATE exam includes questions from previous year GATE papers.

Practice test for UGC NET Computer Science Paper. The questions asked in this NET practice paper are from various previous year papers.