GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
123 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 (78.3k points)   | 123 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 (55.6k 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 Boss (9.9k points)  
0 votes
for odd no of vertices of cycle graph chromatic no is 3.
answered by Loyal (3.3k 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 Junior (995 points)  


Top Users Jul 2017
  1. Bikram

    4910 Points

  2. manu00x

    2940 Points

  3. Debashish Deka

    1870 Points

  4. joshi_nitish

    1776 Points

  5. Arjun

    1506 Points

  6. Hemant Parihar

    1306 Points

  7. Shubhanshu

    1128 Points

  8. pawan kumarln

    1124 Points

  9. Arnab Bhadra

    1114 Points

  10. Ahwan

    956 Points


24,099 questions
31,074 answers
70,703 comments
29,407 users