Gate CS-2003 Question Paper With Solutions

Q. 60 How many perfect matching are there in a complete graph of 6 vertices?

(A) 15

(B) 24

(C) 30

(D) 60

Answer: (A)

Explanation:

Gate CS-2003 Question Paper With Solutions

Learn More:   Gate EC-2012 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here