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

4 Answers

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

So, Chromatic number will be 3
answered by Veteran (58.2k points)  
+3 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 Veteran (10.2k points)  
0 votes
for odd no of vertices of cycle graph chromatic no is 3.
answered by Loyal (3.4k points)  
0 votes

For Cyclic Graph 
if no. of vertices = even then  Chromatic number is

if no. of vertices = odd then  Chromatic number is 3

answered by Active (1.7k points)  


Top Users Sep 2017
  1. Habibkhan

    6334 Points

  2. Warrior

    2202 Points

  3. Arjun

    2150 Points

  4. nikunj

    1980 Points

  5. manu00x

    1726 Points

  6. SiddharthMahapatra

    1718 Points

  7. Bikram

    1706 Points

  8. makhdoom ghaya

    1650 Points

  9. A_i_$_h

    1518 Points

  10. rishu_darkshadow

    1512 Points


25,979 questions
33,554 answers
79,347 comments
31,011 users