Rotation map

In mathematics, a rotation map is a function that represents an undirected edge-labeled graph, where each vertex enumerates its outgoing neighbors. 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. Given a vertex v and an edge label i, the rotation map returns the i'th neighbor of v and the edge label that would lead back to v.

Definition

For a D-regular graph G, the rotation map RotG:[N]×[D]→[N]×[D] is defined as follows: RotG(v,i)=(w,j) if the i th edge leaving v leads to w, and the j th edge leaving w leads to v.

Basic properties

From the definition we see that RotG is a permutation, and moreover RotG∘RotG is the identity map (RotG is an involution).

Special cases and properties

See also

References

  • Reingold, O.; Vadhan, S.; Widgerson, A. (2000). "Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors". Proceedings 41st Annual Symposium on Foundations of Computer Science. pp. 3–13. arXiv:math/0406038. doi:10.1109/SFCS.2000.892006. ISBN 978-0-7695-0850-4. S2CID 420651.