Q40

MSQ2 marks

The following simple undirected graph is referred to as the Peterson graph.

Which of the following statements is/are $\text{TRUE}?$

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.

Loading…