Edge-fault-tolerant bipanconnectivity of hypercubes

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