1.

The chromatic number of a graph is the property of ____________(a) graph coloring(b) graph ordering(c) group ordering(d) group coloringThis question was posed to me during an interview.My query is from Planarity, Degree and Coloring of Graph in section Graphs of Discrete Mathematics

Answer»

The correct CHOICE is (b) graph ordering

The explanation: A graph coloring is an assignment of labels to the vertices of a graph such that no two adjacent vertices SHARE the same labels is called the COLORS of the graph. Now, the chromatic number of any graph is the minimal number of colors for which such an assignment is POSSIBLE.



Discussion

No Comment Found

Related InterviewSolutions