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 in order to conveniently define the zig-zag product and prove its properties. Given a vertex and an edge label , the rotation map returns the 'th neighbor of and the edge label that would lead back to .

This keyword could refer to multiple things. Here are some suggestions: