Exams › GATE › Technical
The following simple undirected graph is referred to as the Peterson graph.
Which of the following statements is/are TRUE?
(A) The chromatic number of the graph is 3.
(B) The graph has a Hamiltonian path.
(C) The following graph is isomorphic to the Peterson graph.
(D) The size of the largest independent set of the given graph is 3. (A subset of vertices of a graph form an independent set if no two vertices of the subset are adjacent.)
- (A) The chromatic number of the graph is 3.
- (B) The graph has a Hamiltonian path.
- (C) The following graph is isomorphic to the Peterson graph.
- (D) The size of the largest independent set of the given graph is 3. (A subset of vertices of a graph form an independent set if no two vertices of the subset are adjacent.)
Correct answer: (A) The chromatic number of the graph is 3.
Solution
The chromatic number of the Petersen graph is indeed 3 because it requires three colors to color the vertices such that no two adjacent vertices share the same color, which is a characteristic of this specific graph.
Related GATE Technical questions
⚔️ Practice GATE Technical free + battle 1v1 →