Fault-free Hamilton cycles in burnt pancake graphs with conditional edge faults

In this paper, we consider the edge fault tolerance of nn-dimensional burnt pancake graph BPnBPn such that each vertex is incident with at least two fault free edges. Based on this requirement, we show that BPnBPn contains a fault free Hamilton cycle even it has up to 2n−52n−5 link faults, where n≥3n≥3.