The asymptotic number of claw-free cubic graphs
Let Hn be the number of claw-free cubic graphs on 2n labeled nodes. In an earlier paper we characterized claw-free cubic graphs and derived a recurrence relation for Hn. Here we determine the asymptotic behavior of this sequence: Hn ∼ (2n)!/e√6πn (n/
|Collections||ANU Research Publications|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.