The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is
Two vertices are said to be adjacent if they are directly connected, i.e., there is a direct edge between them.
So, here, we can assign same color to 1 & 2 (red), 3 & 4 (grey), 5 & 7 (blue) and 6 & 8 (brown).
Therefore, we need a total of 4 distinct colors.
Thus, C is the correct choice.
Please comment below if you find anything wrong in the above post.
Quiz of this Question