Counting acyclic digraphs by sources and sinks
type: Item
instance of: scholarly article
title: Counting acyclic digraphs by sources and sinks
zbMATH Open document ID: 0863.05042
DOI: 10.1016/0012-365X(95)00119-H
author: Ira M. Gessel
published in: Discrete Mathematics
publication date: 1996-12-08T00:00:00Z
review text: The labeled acyclic digraphs have been enumerated by several authors. In this paper these digraphs are counted with respect to the number of their sinks, sources, and edges.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 955161
zbMATH Keywords: enumeration
zbMATH Keywords: labeled acyclic digraphs
reviewed by: Peter Horák
MaRDI profile type: Publication
cites work: Computation of the expected number of leaves in a tree having a given automorphism, and related topics
cites work: \(q\)-enumeration of convex polyominoes
cites work: Combinatorial problems of commutation and rearrangements
cites work: A noncommutative version of the matrix inversion formula
cites work: Enumerative applications of a decomposition for graphs and digraphs
cites work: The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
cites work: On the Number of Maximal Vertices of a Random Acyclic Digraph
cites work: The number of labeled k-trees
cites work: Q5675746
cites work: On the number of labeled acyclic digraphs
cites work: Acyclic orientations of graphs
cites work: Q3754627
description: scientific article; zbMATH DE number 955161