On the number of labeled acyclic digraphs

DOI10.1016/0012-365X(92)90155-9zbMath0761.05050OpenAlexW2089367340MaRDI QIDQ1203946

Vitaliĭ Ivanovich Rodionov

Publication date: 18 February 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90155-9

zbMATH Keywords

generating functionlabeled acyclic digraphs

Mathematics Subject Classification ID

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

Related Items (10)

Enumeration of connected components of acyclic digraph ⋮ Counting acyclic digraphs by sources and sinks ⋮ On some formulas in the problem of enumeration of finite labeled topologies ⋮ On small covers over a product of simplices ⋮ On support sets of acyclic and transitive digraphs ⋮ Invertible and nilpotent matrices over antirings ⋮ A note on small covers over cubes ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ On recursion relations in the problem of enumeration of posets ⋮ Random Generation of Directed Acyclic Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Acyclic orientations of graphs
• On the Number of Maximal Vertices of a Random Acyclic Digraph

This page was built for publication: On the number of labeled acyclic digraphs