ISRO-2007
August 18, 2024ISRO-2007
August 18, 2024ISRO-2007
| Question 7 |
If a graph requires k different colours for its proper colouring, then the chromatic number of the graph is
| 1 | |
| k | |
| k-1 | |
| k/2 |
Question 7 Explanation:
The chromatic number of a graph is the smallest number of colors needed to color the vertices of so that no two adjacent vertices share the same color and if a graph requires k different colours for its proper colouring, then k is the chromatic number of the graph.
Correct Answer: B
Question 7 Explanation:
The chromatic number of a graph is the smallest number of colors needed to color the vertices of so that no two adjacent vertices share the same color and if a graph requires k different colours for its proper colouring, then k is the chromatic number of the graph.