  A descent of a labeled digraph is a directed edge (s, t) with s > t. We count
strong tournaments, strong digraphs, and acyclic digraphs by descents and
edges. To count strong tournaments we use Eulerian generating functions and to
count strong and acyclic digraphs we use a new type of generating function that
we call a graphic Eulerian generating function.
