Symbolic method and directed graph enumeration
Combinatorics
2019-06-13 v2
Abstract
We introduce the arrow product, a systematic generating function technique for directed graph enumeration. It provides 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 recover Robinson's enumerative results on directed graphs where all strongly connected components belong to a given family.
Cite
@article{arxiv.1903.09454,
title = {Symbolic method and directed graph enumeration},
author = {Élie de Panafieu and Sergey Dovgal},
journal= {arXiv preprint arXiv:1903.09454},
year = {2019}
}
Comments
7 pages, 3 figures