GATE CS 2022 (Forenoon) — Question 50

Discrete MathematicsAdvanced Graph Bounds (Matching, Coloring Theorems)MSQ2 marksMedium

The following simple undirected graph is referred to as the Peterson graph.
Question image
Which of the following statements is/are TRUE?
  1. A
    The chromatic number of the graph is 3.
  2. B
    The graph has a Hamiltonian path.
  3. C
    The following graph is isomorphic to the Peterson graph.
    Question image
  4. 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.)
Practise the full 2022-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Advanced Graph Bounds (Matching, Coloring Theorems)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group