Register

Chromatic number

2,241 views

3 Answers

Best answer
1 1 vote
look  if a graph is not complete then chromatic no is dmax.means higest degree of that graph.

u can check it for k4 and others.

so if we remove an edge from kn.then chromatic no is n-1.
• selected by
0 0 votes

n-1

where n is nodes.

in complete every1 is adjacent to each other. so we require n colours.

but removal of any edge causes one less adjacency.so N-1

Voting & Accepting an answer helps improve the community
← Previous · GATE_2014 MENext → · Question on booth's ...
← Previous in category · Set TheoryNext in category → · Set Theory
Position:
Show:

Related questions

0 0 votes
1 1 answer
1.8k
1.8k views
Akriti sood asked Nov 29, 2016
1,825 views
The chromatic number and clique number of C'2k+1(k>3)
The chromatic number and clique number of C'2k+1(k>3) i.e. complement of odd cycle, are respectively ______ 3,2 3,k k,k k+1,k
17 17 votes
1 answers 1 answer
3.5k
3.5k views
pC asked Jan 28, 2016
3,533 views
Haming Distance and Chromatic Number
Consider the undirected graph G defined as follows. The vertices are bit string of length 5. We have an edge between vertex “a” and vertex “b” iff “a” and “b” differ only...
0 0 votes
0 0 answers
423
423 views
LavTheRawkstar asked Apr 21, 2017
423 views
Which fuzzy set is fuzzy number ?
1 1 vote
1 1 answer
870
870 views
akash.dinkar12 asked May 12, 2019
870 views
ISI2018-PCB-CS3
An $n-$variable Boolean function $f:\{0,1\}^n \rightarrow \{0,1\} $ is called symmetric if its value depends only on the number of $1’s$ in the input. Let $\sigma_n $ den...