Computer Sciences > Gate 2022 > Combinational Circuits
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.)
Explanation
Correct : c
Similar Questions
What is the worst-case time complexity of insertion in an AVL tree?
Which operations on a binary search tree have O(h) complexity?
Compare search complexities of sorted array vs balanced BST.