Generating Functions of Some Families of Directed Uniform Hypergraphs
arXiv:2005.11677
Abstract
In this paper, we count acyclic and strongly connected uniform directed labeled hypergraphs. For these combinatorial structures, we introduce a specific generating function allowing us to recover and generalize some results on the number of directed acyclic graphs and the number of strongly connected directed graphs.
added reference