GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
68 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 (75.6k points)   | 68 views

3 Answers

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

So, Chromatic number will be 3
answered by Veteran (51.7k points)  
+1 vote

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.5k points)  
0 votes
for odd no of vertices of cycle graph chromatic no is 3.
answered by Loyal (3.1k points)  
Top Users Feb 2017
  1. Arjun

    5166 Points

  2. Bikram

    4204 Points

  3. Habibkhan

    3748 Points

  4. Aboveallplayer

    2986 Points

  5. sriv_shubham

    2298 Points

  6. Debashish Deka

    2234 Points

  7. Smriti012

    2142 Points

  8. Arnabi

    1998 Points

  9. mcjoshi

    1626 Points

  10. sh!va

    1552 Points

Monthly Topper: Rs. 500 gift card

20,815 questions
25,974 answers
59,606 comments
22,025 users