A directed graph with vertices and e arcs, no self-loops, and no more than one arc directed from any vertex to any vertex , is numbered by assigning to each vertex a distinct element from the set = {1, 2,..., +1}. An arc (, ) from vertex to vertex is numbered (, )= () − () mod ( + 1), where ()...