GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
339 views

If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is

  1. 1
  2. k
  3. k-1
  4. k/2
asked in Graph Theory by Veteran (73.4k points)   | 339 views

2 Answers

+2 votes
The chromatic number of a graph is the smallest number of colors needed to color the vertices so that no two adjacent vertices share the same color.

Ans- Chromatic number = k
answered by Veteran (23.7k points)  
+2 votes
B.chromatic number is the number to color a graph with minimum number of colors. so ans is K
answered by Loyal (3k points)  
chromatic number is  n only for complete graph.Here in the question it is not mentioned whether it is complete or not
yes, in question it is not given that it is complete or not. But here it is  not necessary.

If a graph  colored with n color then chromatic number should be n.Right?Read Question Properly.
Top Users Jan 2017
  1. Debashish Deka

    9660 Points

  2. sudsho

    5554 Points

  3. Bikram

    5280 Points

  4. Habibkhan

    4878 Points

  5. Vijay Thakur

    4498 Points

  6. Arjun

    4418 Points

  7. saurabh rai

    4236 Points

  8. Sushant Gokhale

    4140 Points

  9. Kapil

    3848 Points

  10. santhoshdevulapally

    3808 Points

Monthly Topper: Rs. 500 gift card

19,443 questions
24,221 answers
53,871 comments
20,372 users