A is true for any simple graph G because an independent set in simple graph G becomes clique in complement of G and vice versa.
Option B is false. For example, take an edgeless graph on 4 vertices, so size of minimum vertex cover is 0 but size of maximum clique in complement of G is 4.
Statement B and C are same.