An orbital digraph for a permutation group acting on a finite
set
is the directed graph with vertex
set
and arc set equal to an orbital
of
.
Reversing every arc gives the orbital digraph of the paired
orbital.
If the orbital is self-paired, its opposite arcs can be identified to give an undirected orbital graph.