Question:

What is the minimum number of colours required to colour the following graph?

Show Hint

For path graphs, typically 2 colors are sufficient, but with more vertices, you may need additional colors.
Updated On: May 3, 2025
  • 1
  • 2
  • 3
  • 4
Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

The graph is a simple path graph, where each vertex is connected to at most two other vertices. Since a path graph is a bipartite graph, the chromatic number is 2. However, in this specific case, there are 5 vertices, and since each vertex is connected to at least one other vertex, we would need 3 colors to ensure no two adjacent vertices have the same color.
Thus, the minimum number of colours required is \( 3 \).
Was this answer helpful?
0
0