FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS
From MaRDI portal
Publication:4101855
DOI10.1093/qmath/28.3.363zbMath0335.05121MaRDI QIDQ4101855
Publication date: 1977
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/28.3.363
Related Items
The critical window in random digraphs, Counting connected graphs inside-out, Counting strongly-connected, moderately sparse directed graphs, Asymptotic enumeration of strongly connected digraphs by vertices and edges