Gateforum Test Series: Graph Theory - Graph Matching

Question

 

Comments

Independence number + minimum vertex cover= no. of vertices

So w(G)+y(G)=7

---

I was finding the respective sets.

Thanks for pointing out this relation

---

minimum vertex cover+ maximum independent set=n

So answer is simply 7.

Answer 1

vertex cover  → minimum number of vertex which can cover all edges.
independence number → the maximum number of non-adjacent vertices.

independent set = {a,c,e,g} OR {a,c,e,f}

vertex cover set = {b,d,f} OR {b,d,g}

So, answer is 4+3 = 7

Answer 2

can anyone tell what is the vertex cover of this question?