Let d(n, q) be the number of labeled graphs with n vertices, q ≤ N = (n2) edges, and no isolated vertices. Let x = q/n and k = 2q - n. We determine functions wk ∼ 1, a(x), and φ(x) such that d(n, q) ∼ wk(Nq)enφ(x)+a(x) uniformly for all n and q > n/2. © 1997 Academic Press.
CITATION STYLE
Bender, E. A., Canfield, E. R., & McKay, B. D. (1997). The asymptotic number of labeled graphs with n vertices, q edges, and no isolated vertices. Journal of Combinatorial Theory. Series A, 80(1), 124–150. https://doi.org/10.1006/jcta.1997.2798
Mendeley helps you to discover research relevant for your work.