FORMULAE FOR THE NUMBER OF SPARSELY-EDGED STRONG LABELLED DIGRAPHS

DOI10.1093/QMATH/28.3.363zbMATH Open0335.05121OpenAlexW2040002426MaRDI QIDQ4101855FDOQ4101855

Edward Maitland 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

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

Cited In (5)

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

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

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