GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
85 views
A proper vertex colouring of a graph $G$ is a colouring of the vertices in $G$ in such a way that two vertices get different colours if they are adjacent. The minimum number of colours required for proper vertex colouring of $G$ is called the chromatic number of $G$. Then what is the chromatic number of the cycle graph on 149 vertices?
asked in Graph Theory by Veteran (76.3k points)   | 85 views

3 Answers

+3 votes
As there are odd number of vertices in the cycle graph

So, Chromatic number will be 3
answered by Veteran (53.2k points)  
+2 votes

THE FORMULA FOR CROMATIC NUM OF CYCLIC GRAPH IS

       N - 2(FLOOR(N/2))  + 2

EG : FOR TRIANGLE(3 CYCLE) WE NEED 3 COLOUR AND FORMULA GIVES   3(PUT N=3)

        FOR SQUARE(4 CYCLE) WE NEED =2 COLOURS AND FORMULA GIVES 2

FOR 149 IT WILL BE

              149-2(FLOOR(149/2))+2

            =149-2*74 +2 =149-148+2=3

 

answered by Boss (9.7k points)  
0 votes
for odd no of vertices of cycle graph chromatic no is 3.
answered by Loyal (3.1k points)  


Top Users Apr 2017
  1. akash.dinkar12

    3660 Points

  2. Divya Bharti

    2580 Points

  3. Deepthi_ts

    2040 Points

  4. rude

    1966 Points

  5. Tesla!

    1768 Points

  6. Debashish Deka

    1614 Points

  7. Shubham Sharma 2

    1610 Points

  8. Prashant.

    1492 Points

  9. Arjun

    1472 Points

  10. Arunav Khare

    1464 Points

Monthly Topper: Rs. 500 gift card

22,086 questions
28,063 answers
63,297 comments
24,169 users