We present a greedy algorithm which leads to an improvement over Vizin
g's lower bound on the independence number of a Cartesian-product grap
h. We further obtain certain bounds on independence numbers of Kroneck
er-product and strong-product graphs.