Key points are not available for this paper at this time.
A short proof for the closed expression of the edge-connectivity of Cartesian product graphs is given and the structure of minimum edge cuts is described. It is also proved that the connectivity and edge-connectivity of an arbitrary Cartesian power equals its minimum degree.
Klavžar et al. (Sat,) studied this question.