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