Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs

DOI10.1007/S00373-004-0569-9zbMATH Open1055.05081OpenAlexW2039891646MaRDI QIDQ704838FDOQ704838

Authors: Bertran Steinsky 

Publication date: 20 January 2005

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-004-0569-9

Recommendations

• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• On the number of labeled acyclic digraphs
• The asymptotic number of labeled connected graphs with a given number of vertices and edges
• scientific article; zbMATH DE number 166082
• Asymptotic behaviour of essential graphs
• Asymptotic properties of labeled connected graphs
• Asymptotic enumeration of extensional acyclic digraphs
• Asymptotic enumeration of extensional acyclic digraphs
• Refinement of the asymptotics of the number of labeled series-parallel graphs
• Asymptotic enumeration of labeled multigraphs by vertices, edges, and degree parities

zbMATH Keywords

Bayesian networkAsymptotic enumerationChain graphLabelled essential directed acyclic graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (11)

• Asymptotic behaviour of essential graphs
• Asymptotical behaviour of directed graphs
• The asymptotic number of acyclic digraphs. I
• Enumeration of labelled essential graphs.
• Asymptotic enumeration of compacted binary trees of bounded right height
• Counting extensional acyclic digraphs
• Uniform random generation of large acyclic digraphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Random generation of essential directed acyclic graphs
• A review of Gaussian Markov models for conditional independence
• Asymptotic enumeration of extensional acyclic digraphs

This page was built for publication: Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs

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