Enumerating characteristics of a kind of chain-like graphs

zbMATH Open1240.05158MaRDI QIDQ3171204FDOQ3171204

Authors: Zhenyu Wang 

Publication date: 29 September 2011

Recommendations

• scientific article; zbMATH DE number 4010561
• Bell and Stirling numbers for graphs
• On the combinatorics of binary series-parallel graphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Stirling numbers of the second kind and Bell numbers for graphs

zbMATH Keywords

Stirling numbers of second kindchain-like graphconcurrent program complexity metrics

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30)

This page was built for publication: Enumerating characteristics of a kind of chain-like graphs

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