Location of Repository

Complete Rotations in Cayley Graphs

By Marie-claude Heydemann, Nausica Marlin and Stéphane Pérennes

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 investigate 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

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.8079
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-sop.inria.fr/sloop/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.