GATE-2024-CS1(Forenoon)
March 23, 2025NTA UGC NET Dec 2024 Paper-1
March 24, 2025GATE 2022
| Question 50 |
The following simple undirected graph is referred to as the Peterson graph.
Which of the following statements is/are TRUE?
Which of the following statements is/are TRUE?
| The chromatic number of the graph is 3. | |
| The graph has a Hamiltonian path | |
| The following graph is isomorphic to the Peterson graph.  | |
| 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.) |
Question 50 Explanation:
Chromatic number is 3.
Peterson graph ihas hamiltonian path but not hamiltonian cycle
Given graph in option C is isomorphic as the given has same number of vertice, edges, degree sequence and cycles.
LArgest independent set can be more than 3
Peterson graph ihas hamiltonian path but not hamiltonian cycle
Given graph in option C is isomorphic as the given has same number of vertice, edges, degree sequence and cycles.
LArgest independent set can be more than 3
Correct Answer: C
Question 50 Explanation:
Chromatic number is 3.
Peterson graph ihas hamiltonian path but not hamiltonian cycle
Given graph in option C is isomorphic as the given has same number of vertice, edges, degree sequence and cycles.
LArgest independent set can be more than 3
Peterson graph ihas hamiltonian path but not hamiltonian cycle
Given graph in option C is isomorphic as the given has same number of vertice, edges, degree sequence and cycles.
LArgest independent set can be more than 3