Syntax error Finding the chromatic number of complete graph

Finding the chromatic number of complete graph

Problem Statement

What is the chromatic number of complete graph Kn?

Solution

Chromatic Number Example

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.

Updated on: 2019-08-23T07:23:37+05:30

4K+ Views

Kickstart Your Career

Get certified by completing the course

Get Started
Advertisements