Asymptotic enumeration of strongly connected digraphs by vertices and edges

DOI10.1002/rsa.20416zbMath1270.05058arXiv1005.1285WikidataQ57991439 ScholiaQ57991439MaRDI QIDQ2844083

Xavier Pérez-Giménez, Nicholas C. Wormald

Publication date: 27 August 2013

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.1285

zbMATH Keywords

asymptotic enumeration; directed graphs; strongly connected

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05A16: Asymptotic enumeration

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity