Asymptotic properties of labeled connected graphs

DOI10.1002/rsa.3240030208zbMath0779.05044OpenAlexW2068345700MaRDI QIDQ3990221

Brendan D. McKay, Edward A. Bender, E. Rodney Canfield

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1002/rsa.3240030208

zbMATH Keywords

asymptotic expansionbridgelabelled connected random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)

Related Items (5)

Forbidden subgraphs in connected graphs ⋮ Local limit theorems for subgraph counts ⋮ Local Limit Theorems for the Giant Component of Random Hypergraphs ⋮ The Asymptotic Number of Connectedd-Uniform Hypergraphs ⋮ On the growth of components with non-fixed excesses

Cites Work

• The number of connected sparsely edged graphs. III. Asymptotic results
• The asymptotic number of labeled connected graphs with a given number of vertices and edges

This page was built for publication: Asymptotic properties of labeled connected graphs