Asymptotical behaviour of directed graphs

MaRDI QIDQ3397695zbMATH OpenFDO

Authors Angel Garrido

Publication date 22 September 2009

zbMATH Keywords

asymptotic analysisenumeration of graphsgraph theory

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (including graph drawing) in computer science (68R10) Knowledge representation (68T30)

Recommendations

• Asymptotic behaviour of essential graphs
• The size distribution for Markov equivalence classes of acyclic digraph models.
• Some results about essential graphs
• A characterization of Markov equivalence classes for acyclic digraphs
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs

Cited in

(5)

• Commute times for a directed graph using an asymmetric Laplacian
• Asymptotic behaviour of essential graphs
• Some results about essential graphs
• THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS: A COMPARISON
• Asymptotic structure and singularities in constrained directed graphs

This page was built for publication: Asymptotical behaviour of directed graphs

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