FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS

DOI10.1093/QMATH/28.3.363zbMath0335.05121OpenAlexW2040002426MaRDI QIDQ4101855

E. M. Wright

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

The critical window in random digraphs ⋮ The birth of the strong components ⋮ Counting connected graphs inside-out ⋮ Counting strongly-connected, moderately sparse directed graphs ⋮ Asymptotic enumeration of strongly connected digraphs by vertices and edges

This page was built for publication: FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS