Generating functions of some families of directed uniform hypergraphs

MaRDI QIDQ2199871zbMATH OpenFDO

Authors Rasendrahasina Vonjy, Ravelomanana Vlady

Publication date 14 September 2020

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.11677, http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2020//72.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

generating functionsacyclic digraphsdirected labeled hypergraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Paths and cycles (05C38) Connectivity (05C40) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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.

Recommendations

• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 3977044
• Enumeration of unlabeled directed hypergraphs
• An approximate Dirac-type theorem for \(k\)-uniform hypergraphs
• On the degree sequences of uniform hypergraphs
• A generalization of the Hajnal-Szemerédi theorem for uniform hypergraphs
• Enumeration of unlabeled uniform hypergraphs
• The counting of uniform acyclic hypergraphs
• The \(Q\)-generating function for graphs with application
• The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• scientific article; zbMATH DE number 3585466 (Why is no real title available?)
• scientific article; zbMATH DE number 3226832 (Why is no real title available?)
• scientific article; zbMATH DE number 3294293 (Why is no real title available?)
• scientific article; zbMATH DE number 3316739 (Why is no real title available?)
• scientific article; zbMATH DE number 3348134 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• scientific article; zbMATH DE number 7651064 (Why is no real title available?)
• Acyclic orientations of graphs
• Analytic combinatorics
• Counting acyclic digraphs by sources and sinks
• Directed hypergraphs and applications
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Directed recursive labelnode hypergraphs: A new representation-language
• Enumeration and structure of inhomogeneous graphs
• Enumerative applications of a decomposition for graphs and digraphs
• Generalized AND/OR graphs
• The Number of k-Coloured Graphs on Labelled Nodes
• The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• The asymptotic number of acyclic digraphs. I
• The critical behavior of random digraphs
• The transitive closure of a random digraph

Cited in

(6)

• scientific article; zbMATH DE number 563034 (Why is no real title available?)
• On the number of labeled acyclic digraphs
• Generating functions for directed animals convex following their direction
• Symbolic method and directed graph enumeration
• The counting series for unlabeled linear acyclic hypergraphs.
• The birth of the strong components

This page was built for publication: Generating functions of some families of directed uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199871)