Gate CS-2005 Question Paper With Solutions

Q. 11 Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of the maximum indepen­dent set of G is

(A) 12

(B) 8

(C) Less than 8

(D) More than 12

Answer: (A)

Explanation:

Gate CS-2005 Question Paper With Solutions

Learn More:   Gate EE-2014-1 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here