find the charmatic number in graph
Answers
Answered by
1
Answer:
Solution. In a complete graph, each vertex is adjacent to is remaining (n–1) vertices. Hence, each vertex requires a new color. Hence the chromatic number Kn = n.
Similar questions