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 independent set of G is: A. 12 B. 8 C. less than 8 D. more than 12
GATE 2005 · Discrete Mathematics · Graph Connectivity · medium
Answer: Maximum independent set size = 20 - 8 = 12, which is option A.
Cover and independent set are complements: Removing a vertex cover leaves no edge uncovered, so the remaining vertices have no edge between them, i.e. they are independent. Making the cover smallest makes this remaining independent set largest.
Apply the Gallai count: With |V| = 20 and minimum vertex cover tau(G) = 8, the maximum independent set is alpha(G) = 20 - 8 = 12. The 100 edges are extra information not needed for the count.