Generating Functions of Some Families of Directed Uniform Hypergraphs
Combinatorics
2020-05-28 v2
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.
Keywords
Cite
@article{arxiv.2005.11677,
title = {Generating Functions of Some Families of Directed Uniform Hypergraphs},
author = {Vonjy Rasendrahasina and Vlady Ravelomanana},
journal= {arXiv preprint arXiv:2005.11677},
year = {2020}
}
Comments
added reference