Symbolic Method and Directed Graph Enumeration

We introduce the arrow product, a new generating function technique for directed graph enumeration. It provides new short proofs for previous results of Gessel on the number of directed acyclic graphs and of Liskovets, Robinson and Wright on the number of strongly connected directed graphs. We also obtain new enumerative results on directed graphs where all strongly connected components belong to a given family.