Skip to content
Related Articles

Related Articles

Improve Article

GATE | GATE-CS-2003 | Question 36

  • Difficulty Level : Medium
  • Last Updated : 28 Jun, 2021

How many perfect matchings are there in a complete graph of 6 vertices ?
(A) 15
(B) 24
(C) 30
(D) 60

Answer: (A)

Explanation: A perfect matching, every vertex of the graph is incident to exactly one edge of the matching. A perfect matching is therefore a matching of a graph containing n/2 edges, the largest possible, meaning perfect matchings are only possible on graphs with an even number of vertices. (Source

Quiz of this Question

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :