Xavier Pérez-Giménez, Nicholas C. Wormald. Asymptotic enumeration of strongly connected digraphs by vertices and edges. Random Struct. Algorithms, 43(1):80-114, 2013. [doi]
@article{Perez-GimenezW13,
title = {Asymptotic enumeration of strongly connected digraphs by vertices and edges},
author = {Xavier Pérez-Giménez and Nicholas C. Wormald},
year = {2013},
doi = {10.1002/rsa.20416},
url = {http://dx.doi.org/10.1002/rsa.20416},
researchr = {https://researchr.org/publication/Perez-GimenezW13},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {80-114},
}