Asymptotic behaviour of essential graphs

MaRDI QIDQ3397682zbMATH OpenFDO

Authors Angel Garrido

Publication date 22 September 2009

zbMATH Keywords

combinatoricsenumeration of graphsgraph labelinggraph theorysymptotic analysis

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Asymptotic analysis in optics and electromagnetic theory (78M35)

Recommendations

• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• Asymptotical behaviour of directed graphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Some results about essential graphs
• Random generation of essential directed acyclic graphs

Cited in

(6)

• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Combinatorial analysis by the Ihara zeta function of graphs
• Asymptotical behaviour of directed graphs
• Some results about essential graphs
• Asymptotic structure and singularities in constrained directed graphs
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs

This page was built for publication: Asymptotic behaviour of essential graphs

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