Connectivity of strong products of graphs (Q1959713)

The strong product of graphs is one of the three commutative and associative graph products. Let \(S\) be the strong product of two given graphs. The author proves that every minimum separating set in \(S\) is either an \(I\)-set or an \(L\)-set in \(S\). This implies that the minimum separating sets in a strong product of graphs are induced by separating sets of factors. Finally, the definition of an \(I\)-set and an \(L\)-set is generalized for strong products of arbitrary finite number of factors.