Given two vertices u and v in a connected undirected graph G, a w⁎-container $C(u,v)$ is a set of w internally vertex disjoint paths between u and v spanning all the vertices in G. A bipartite graph G is $w^{⁎}$-laceable if there exists a $w^{⁎}$-container between any two vertices belonging to different partitions of G. In [8], [33] a class $B_n^{\prime }$ of bipartite graphs called hypercube-like bipartite networks was defined. In [22], Lin et al. showed that every graph in $B_n^{\prime }$ is $w^{⁎}$-laceable for every $1\le w\le n$. We define a graph is f-edge fault tolerant $w^{⁎}$-laceable if $G-F$ is $w^{⁎}$-laceable for any arbitrary subset F of edges of G with $|F|\le f$. In this paper we show that every graph in $B_n^{\prime }$ is f-edge-fault tolerant $w^{⁎}$-laceable for every $0\le f\le n-2$ and $1\le w\le n-f$ which generalize Lin's result. We also give generalization of two other results in [22], [27].

给定两个顶点ù和v在连接无向图G ^，一瓦特⁎容器$C（ü，v）$是u和v之间的w个内部顶点不相交路径的集合，跨越G中的所有顶点。二分图G为$w^{⁎}$可系带（如果存在） $w^{⁎}$-属于G的不同分区的任意两个顶点之间的容器。在[8]，[33]一堂课中${乙}_{ñ}^{\prime }$定义了称为超立方体状二分网络的二分图。在[22]中，Lin等。显示出每个图中${乙}_{ñ}^{\prime }$ 是 $w^{⁎}$-可系带 $\mathrm{1个}\le w\le ñ$。我们定义一个图是f -edge容错的$w^{⁎}$可系带 $G-F$ 是 $w^{⁎}$-laceable对于任何任意子集˚F的边缘ģ与$|F|\le F$。在本文中，我们显示了${乙}_{ñ}^{\prime }$是˚F〜边缘，容错$w^{⁎}$-可系带 $0\le F\le ñ-2$ 和 $\mathrm{1个}\le w\le ñ-F$概括了林的结果。我们还在[22]，[27]中给出了另外两个结果的概括。