“…The corresponding concept of spanning connectivity in bipartite graphs is spanning laceability. A lot of interconnection networks are proved to be super spanning laceable [2], [3], [11], [15], [16], [19], [21], [23], [24]. The burnt pancake graphs B n was proposed by Gates and Papadimitriou [6].…”