{'fraction_non_alphanumeric': 0.07924528301886792, 'fraction_numerical': 0.007547169811320755, 'mean_word_length': 4.771739130434782, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
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(Sn, B) be the Cayley graphs generated by transposition-generating trees. It is known that for any F⊂E(Cay(Sn, 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(Sn, B)−F is bipancyclic if Cay(Sn, B) is not a star graph, for n≥4 and |F|≤n−3.