Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity

DOI10.1112/jlms/s2-20.1.1zbMath0406.05037OpenAlexW1966101474MaRDI QIDQ4192092

Nicholas C. Wormald

Publication date: 1979

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-20.1.1

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Connectivity (05C40)

Related Items

On the Number of Automorphisms of a Regular Graph ⋮ The asymptotic connectivity of labelled regular graphs ⋮ The asymptotic number of claw-free cubic graphs. ⋮ ${\cal N}=2$ N = 2 gauge theories: Congruence subgroups, coset graphs, and modular surfaces ⋮ Counting labeled general cubic graphs ⋮ Counting labeled claw-free cubic graphs by connectivity ⋮ Ménage numbers, bijections and P-recursiveness ⋮ Invertibility of adjacency matrices for random \(d\)-regular graphs ⋮ Enumeration of cubic graphs by inclusion-exclusion