Jump to content

Rotation map

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tomgur (talk | contribs) at 10:12, 12 October 2010. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In Mathematics, a rotation map is a function that represents an undirected edge-labeled graph (where each vertex enumerates its neighbors in an arbitrary, though fixed, way) through a permutation on pairs of vertex name and edge label. Given a vertex and an edge label , the rotation map of an undirected labeled graph will return the 'th neighbor of and the edge label that would lead back to . Rotation maps were first introduced by Reingold, Vadhan and Wigderson (“Entropy waves, the zig-zag graph product, and new constant-degree expanders”, 2002) in order to conveniently define the zig-zag product and prove its properties.

Definition

For a -regular graph , the rotation map is defined as follows: if the 'th edge incident to leads to , and this edge is the 'th edge incident to .

Basic Properties

Straight from the definition we see that is a permutation, and moreover is the identity map. In addition, the existence of a rotation map for graph does not imply that the graph is consistently labeled.

Special cases

  1. Let be a -regular undirected labeled graph with a rotation map that holds where denotes the 'th neighbor of . In this case each undirected edge shares the same label for both directions, and colors are often used to describe the labels.
  2. Let be a -regular undirected labeled graph for which exists a function which holds

See also

References

  • Reingold, O.; Vadhan, S.; Widgerson, A. (2000), "Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors", 41st Annual Symposium on Foundations of Computer Science, doi:10.1109/SFCS.2000.892006