Asymptotic enumeration of strongly connected digraphs by vertices and edges
Work
Year: 2012
Type: article
Abstract: We derive an asymptotic formula for the number of strongly connected digraphs with n vertices and m arcs (directed edges), valid for m ‐ n → ∞ as n → ∞ provided m = O ( n log n ). This fills the gap ... more
Source: Random Structures and Algorithms
Institution University of Waterloo
Cites: 13
Cited by: 11
Related to: 10
FWCI: 1.002
Citation percentile (by year/subfield): 77.16
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green