Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees

摘要

The Cayley graphs on the symmetric group plays an important role in the study of Cayley graphs as interconnection networks. Let Cay(S-n, B) be the Cayley graphs generated by transposition-generating trees. It is known that for any F subset of E(Cay(S-n, B)), if |F|<= n-3 and n >= 4, then there exists a hamiltonian cycle in Cay(Sn, B)-F. In this paper, we show that Cay(S-n, B)-F is bipancyclic if Cay(S-n, B) is not a star graph, for n >= 4 and |F|<= n-3.