aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Test 4 - Algorithms | Computer Science(CS)
  • The minimum number of colours required to colour the vert...
Multiple choice

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 same colour is.

  1. 2

  2. 3

  3. 4

  4. $n − 2 \left[ \dfrac{n}{2} \right] + 2$
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions

  • What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cy...
  • If there are n devices (nodes) in a network,what is the number of cable links required for a mesh and a sta...
  • There are 30 socks in a drawer. 60% of the socks are red and the rest are blue. What is the minimum number ...
  • Let the binary heap has depth equal to d. What is the minimum number of nodes in the heap?
  • The product of LCM and GCF of two natural numbers is equal to the _____ of the two numbers.
  • If the greatest common factor of the two natural numbers is 1, we say that the numbers are
  • The modern periodic table has elements arranged in increasing atomic numbers. It has ___________vertical co...
  • The distance between a node and an adjacent antinode in a stationary wave is
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy