BibTeX
CSL-JSON
MLA
Harvard
Generating Functions of Some Families of Directed Uniform Hypergraphs
release_7nuq246svva7laxc6n7rt7sme4
by
Vonjy Rasendrahasina, Vlady Ravelomanana
Released
as a article
.
2020
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.
In text/plain
format
Archived Content
There are no accessible files associated with this release. You could check other releases for this work for an accessible version.
"Dark" Preservation Only
Save Paper Now!
Know of a fulltext copy of on the public web? Submit a URL and we will archive it
arXiv
2005.11677v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links