Edge-fault-tolerant bipanconnectivity of hypercubes

This paper shows that for any two distinct vertices u and v with distance d in the hypercube image (image) with at most image faulty edges and each vertex incident with least two fault-free edges, there exist fault-free uv-paths of length image in image for every image with image and image. This result improves some known results on edge-fault bipanconnectivity of hypercubes. The proof is based on the recursive structure of image.