Complete Rotations in Cayley Graphs

@article{Heydemann2001CompleteRI,
  title={Complete Rotations in Cayley Graphs},
  author={Marie-Claude Heydemann and Nausica Marlin and St{\'e}phane P{\'e}rennes},
  journal={Eur. J. Comb.},
  year={2001},
  volume={22},
  pages={179-196}
}
As it is introduced by Bermond, Prennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for intercon-nection networks, admit a special automorphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, some optimal gossiping algorithms can be easily designed by using a complete rotation, and the constructions of the best known edge disjoint spanning trees in the toroidal… CONTINUE READING