Counting acyclic digraphs by sources and sinks

DOI10.1016/0012-365X(95)00119-HMaRDI QIDQ1126301zbMATH OpenFDO

Authors Ira M. Gessel

Publication date 8 December 1996

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

enumerationlabeled acyclic digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cites work

• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• A noncommutative version of the matrix inversion formula
• Acyclic orientations of graphs
• Combinatorial problems of commutation and rearrangements
• Computation of the expected number of leaves in a tree having a given automorphism, and related topics
• Enumerative applications of a decomposition for graphs and digraphs
• On the Number of Maximal Vertices of a Random Acyclic Digraph
• On the number of labeled acyclic digraphs
• The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
• The number of labeled k-trees
• \(q\)-enumeration of convex polyominoes

Cited in

(11)

• Generating connected acyclic digraphs uniformly at random
• Counting acyclic and strong digraphs by descents
• Random Generation of Directed Acyclic Graphs
• Asymptotic enumeration of extensional acyclic digraphs
• Symbolic method and directed graph enumeration
• Generating functions of some families of directed uniform hypergraphs
• Acyclic digraphs
• Counting directed acyclic and elementary digraphs
• Counting extensional acyclic digraphs
• Acyclic orientations and the chromatic polynomial
• The birth of the strong components

This page was built for publication: Counting acyclic digraphs by sources and sinks

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