A self-converse digraph is a directed graph that
is isomorphic to its converse, the directed graph obtained by reversing every arc.
Harary and Palmer (1966) enumerated self-converse digraphs. Harary and Palmer (1973, p. 260) later listed the enumeration of labeled self-converse digraphs as a graphical enumeration problem.
Harary, F. and Palmer, E. M. "Enumeration of Self-Converse Digraphs." Mathematika13, 151-157, 1966.Harary,
F. and Palmer, E. M. "A Survey of Graphical Enumeration Problems."
In A Survey of Combinatorial Theory (Ed. J. N. Srivastava). Amsterdam,
Netherlands: North-Holland, pp. 259-275, 1973.
