Asymptotic behaviour of essential graphs
From MaRDI portal
Publication:3397682
zbMATH Open1176.68140MaRDI QIDQ3397682FDOQ3397682
Authors: Angel Garrido 
Publication date: 22 September 2009
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
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Asymptotic analysis in optics and electromagnetic theory (78M35)
Cited In (5)
- Asymptotical behaviour of directed graphs
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- Combinatorial analysis by the Ihara zeta function of 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)
