scientific article; zbMATH DE number 861357

MaRDI QIDQ4871083zbMATH OpenFDO

Authors Xiaoji Wang

Publication date 28 March 1996

zbMATH Keywords

enumerationdigraphsexcess sequence

Mathematics Subject Classification ID

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

Recommendations

• Asymptotic enumeration of extensional acyclic digraphs
• Asymptotic enumeration of extensional acyclic digraphs
• Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
• Asymptotic enumeration of graphs with given degree sequence
• Asymptotic enumeration of Cayley digraphs
• Asymptotic Enumeration of Hypergraphs by Degree Sequence
• Asymptotic enumeration by degree sequence of graphs of high degree
• scientific article; zbMATH DE number 91021
• The asymptotic number of acyclic digraphs. II
• Asymptotic enumeration of strongly connected digraphs by vertices and edges

Cited in

(5)

• The asymptotic number of acyclic digraphs. I
• On counting limited outdegree grid digraphs and greatest increase grid digraphs
• AN ASYMPTOTIC FORMULA FOR exp(x/1-x)
• scientific article; zbMATH DE number 91021 (Why is no real title available?)
• Asymptotic enumeration of Cayley digraphs

This page was built for publication:

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