|
|||||
|
|
The asymptotic number of claw-free cubic graphs |
|
| Authors: | Brendan D McKay Ronald C Read |
| Institution: | a Computer Science Department, Australian National University, Canberra, ACT 0200, Australia b Department of Mathematics, Michigan State University, East Lansing, MI 48824-1027, USA c Department of Combinatorics and Optimization, Faculty of Mathematics, University of Waterloo, Waterloo, Ont., Canada N2L 3G1 d Computer Science Department, University of Georgia, Athens, GA 30602-7404, USA |
| Abstract: | 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: |
| Keywords: | Cubic graphs Claw-free Asymptotic enumeration |
| 本文献已被 ScienceDirect 等数据库收录！ | |