on the zero forcing number of complementary prism graphs

The zero forcing number of a graph is the minimum cardinality among all the zero forcing sets of a graph $g$.  the aim of this article is to compute the zero forcing number of complementary prism graphs.  some bounds on the zero forcing number of complementary prism graphs are presented. the remainder of this article discusses the following result.  let $g$ and $overline{g }$ be connected graphs. then $z(goverline{g})leq n-1$ if and only if  there exists two vertices $v_i,v_j in v(g)$ and $ineq j$ such that, either $n(v_i) subseteq n(v_j)$ or $n[v_i] subseteq n[v_j]$ in $g$.