Question

Find the chromatic number of the given graph.

Short answer

The Chromatic number of the given graph is \(3\).

Step-by-step solution

Given data in the question.

In the question, a graph is given.

Definition to be used.

According to the definition of chromatic number of a graph, the chromatic number of a graph is the least number of colors needed to color a graph so that no two adjacent vertices are assigned the same color.

Find the chromatic number of the given graph.

Since, the every pair of vertices \(a,b\) and \(c\) is connected directly. So, the color of vertices \(a,b\) and \(c\) should be different.

Similarly,

The vertex \(d\) is connected directly to the vertex \(a\) but not \(b\)and \(c\). So, the color of vertices \(d\) and \(b\) can be same.

The every pair of vertices \(d,e\) and \(f\) is connected directly. So, the color of vertices \(d,e\) and \(f\) should be different.

Similarly, color can be assigned to all the other vertices as follows:

Vertex	Color
a	Blue
b	Red
c	Green
d	Red
e	Blue
f	Green
g	Blue
h	Red
i	Green
j	Red
k	Blue
l	Green
m	Blue
n	Red
o	Green

Hence, \(3\) different colors are used to color the given graph. So, the chromatic number of the given graph is \(3\).