Skip to Main content Skip to Navigation

Cayley Graphs with Complete Rotations

Marie-Claude Heydemann 1 Nausica Marlin Stéphane Pérennes
1 SLOOP - Simulation, Object Oriented Languages and Parallelism
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : As it is introduced by Bermond, Pérennes, and Kodate and by Fragopoulou and Akl, some Cayley graphs, including most popular models for interconnection 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 meshes and the hypercubes are based on such an automorphism. Our purpose is to investigat- e such Cayley graphs. We relate some symmetries of a graph with potential algebraic symmetries appearing in its definition as a Cayley graph on a group. In the case of Cayley graphs defined on a group generated by transpositions, we characterize the ones admitting a complete rotation.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:42:30 AM
Last modification on : Wednesday, October 14, 2020 - 4:24:17 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:32:49 PM


  • HAL Id : inria-00073053, version 1



Marie-Claude Heydemann, Nausica Marlin, Stéphane Pérennes. Cayley Graphs with Complete Rotations. RR-3624, INRIA. 1999. ⟨inria-00073053⟩



Record views


Files downloads