edited by
3,941 views

2 Answers

Best answer
6 votes
6 votes
The chromatic number of a graph is the smallest number of colors needed to color the vertices so that no two adjacent vertices share the same color.

Ans- Chromatic number = k
selected by
2 votes
2 votes
B.chromatic number is the number to color a graph with minimum number of colors. so ans is K
Answer:

Related questions

7 votes
7 votes
2 answers
1
go_editor asked Jun 10, 2016
3,652 views
Let $X$ be the adjacency matrix of a graph $G$ with no self loops. The entries along the principal diagonal of $X$ areall zerosall onesboth zeros and onesdifferent
11 votes
11 votes
2 answers
2
go_editor asked Jun 10, 2016
2,806 views
A graph with $n$ vertices and $n-1$ edges that is not a tree, isConnectedDisconnectedEulerA circuit
1 votes
1 votes
0 answers
3