Rotational Cayley Graphs on Transposition Generated Groups

As it is introduced by Bermond, Kodate, and Prénnes, some Cayley graphs, in cluding most popular models for interconnection networks admit a special automorphism, called complete rotation. Such anautomorphism is often used to derive algorithms or properties of the underlying graph For example, optimal gossiping algorithms can be easily designed, and the constructions of the best known edge disjoint spanning trees in the toroidal meshes and the hypercubes are based on such an automorphism. Our purpose is to characterize among Cayley graphs defined a group generated by transpositions, which admit a complete rotation.