Question

How many unique colors will be required for proper vertex coloring of an empty graph having n vertices?

(a) 0

(b) 1

(c) 2

(d) n

The question was asked at a job interview.

The above asked question is from Graph Coloring topic in section Graph Coloring of Data Structures & Algorithms II

Answer 1

The correct choice is (b) 1

The best I can explain: An empty graph is a graph without any edges. So the number of unique colors required for proper coloring of the graph will be 1.