The \(k\)-restricted edge-connectivity of a product of graphs (Q1759863)

The generalization of the Cartesian product of graphs, the product graph \(G_{m}\ast G_{p}\) was introduced by \textit{J. C. Bermond, C. Delorme} and \textit{G. Farhi} [J. Comb. Theory, Ser. B 36, 32-48 (1984; Zbl 0539.05038)]. From the authors' abstract: ``The connectivity of these product graphs is approached by studying the \(k\)-restricted edge-connectivity, which is defined as the minimum number of edges of a graph whose deletion yields a disconnected graph with all its components having at least \(k\) vertices. To be more precise, we present lower and upper bounds for the \(k\)-restricted edge-connectivity of \(G_{m}\ast G_{p}\), and provide sufficient conditions that ensure an optimal value for this parameter. When both \(G_{m}\) and \(G_{p}\) are regular graphs, conditions for guaranteeing that \(G_{m}\ast G_{p}\) is super-\(\lambda _{(k)}\) are also presented, and the particular case where both \(G_{m}\) and \(G_{p}\) are complete graphs is considered.''