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.)

Correct : c

Similar Questions

Consider a digital display system (DDS) shown in the figure that displays the contents of register X. A 16-bit code word is used to load a word in X, either fr...
#786 MCQ
A palindrome is a word that reads the same forwards and backwards. In a game of words, a player has the following two plates painted with letters. From...
#1 MCQ
Which number does not belong in the series below? 2, 5, 10, 17, 26, 37, 50, 64
#4 MCQ

Related Topics

graph theory Peterson graph chromatic number Hamiltonian path isomorphic graphs largest independent set GATE CS 2022 computer science gate graph coloring graph paths independent sets

Unique Visitor Count

Total Unique Visitors

Loading......