Symbolic method and directed graph enumeration
Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 989-996
Élie de Panafieu; Sergey Dovgal; Élie de Panafieu; Sergey Dovgal. Symbolic method and directed graph enumeration. Acta mathematica Universitatis Comenianae, Tome 88 (2019) no. 3, pp. 989-996. http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a98/
@article{AMUC_2019_88_3_a98,
     author = {\'Elie de Panafieu and Sergey Dovgal and \'Elie de Panafieu and Sergey Dovgal},
     title = { Symbolic method and directed graph enumeration},
     journal = {Acta mathematica Universitatis Comenianae},
     pages = {989--996},
     year = {2019},
     volume = {88},
     number = {3},
     url = {http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a98/}
}
TY  - JOUR
AU  - Élie de Panafieu
AU  - Sergey Dovgal
AU  - Élie de Panafieu
AU  - Sergey Dovgal
TI  - Symbolic method and directed graph enumeration
JO  - Acta mathematica Universitatis Comenianae
PY  - 2019
SP  - 989
EP  - 996
VL  - 88
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a98/
ID  - AMUC_2019_88_3_a98
ER  - 
%0 Journal Article
%A Élie de Panafieu
%A Sergey Dovgal
%A Élie de Panafieu
%A Sergey Dovgal
%T Symbolic method and directed graph enumeration
%J Acta mathematica Universitatis Comenianae
%D 2019
%P 989-996
%V 88
%N 3
%U http://geodesic.mathdoc.fr/item/AMUC_2019_88_3_a98/
%F AMUC_2019_88_3_a98

Voir la notice de l'article provenant de la source Comenius University

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.