On the zero forcing number of corona and lexicographic product of graphs

I. Javaid, I. Irshad, M. Batool +1

The zero forcing number of a graph $G$, denoted by $Z(G)$, is the minimum cardinality of a set $S$ of black vertices (where vertices in $V(G)\setminus S$ are colored white) such th…