The asymptotic number of acyclic digraphs. II

DOI10.1016/0095-8956(88)90044-5zbMath0654.05035OpenAlexW2045940223MaRDI QIDQ1108287

Edward A. Bender, Robert W. Robinson

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90044-5

zbMATH Keywords

enumerationvertex connectivityde Bruijn graphsacyclic digraphedge connectivityweakly connected digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (10)

On the shape of a random acyclic digraph ⋮ Asymptotic enumeration of extensional acyclic digraphs ⋮ The birth of the strong components ⋮ Counting extensional acyclic digraphs ⋮ Exact enumeration of acyclic deterministic automata ⋮ Unnamed Item ⋮ Counting Phylogenetic Networks with Few Reticulation Vertices: Tree-Child and Normal Networks ⋮ Uniform random generation of large acyclic digraphs ⋮ Is hyper-extensionality preservable under deletions of graph elements? ⋮ Asymptotic enumeration of compacted binary trees of bounded right height

Cites Work

• The asymptotic number of acyclic digraphs. I
• Graphs on unlabelled nodes with a given number of edges
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic number of acyclic digraphs. II