No label defined (Q4935900)

The optimal connectivity of bipartite graphs is considered. This problem can be presented as follows: \[ \begin{alignedat}{2} & 1^\circ\text{ mx}(\lambda|n;n; e;\text{Bio.});\quad && 5^\circ\text{ mx}(\kappa|n; e;\text{Bio.});\\ & 2^\circ\text{ mx}(\lambda|n_1,n_2; e,\text{Bio.}); \quad && 6^\circ\text{ mx}(\kappa|n_1,n_2; e;\text{Bio.});\\ & 3^\circ\text{ mn}(e|n;\lambda\geq m;\text{Bio.});\quad && 7^\circ\text{ mn}(e|n;\kappa\geq m;\text{Bio.});\\ & 4^\circ\text{ mn}(e|n_1, n_2;\lambda\geq m;\text{Bio.});\quad && 8^\circ\text{ mn}(e|n_1,n_2;\kappa\geq m;\text{Bio.}).\end{alignedat} \] The authors give the optimal connectivity of the bipartite graph \(B^m_{n_1,n_2}\), which is just the solution of the question.