Symbolic method and directed graph enumeration
From MaRDI portal
Publication:6316043
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.
This page was built for publication: Symbolic method and directed graph enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6316043)
