| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650845 | Discrete Mathematics | 2007 | 14 Pages |
Abstract
Recurrence relations are derived for the numbers of labeled 3-regular graphs with given connectivity, order, number of double edges, and number of loops. This work builds on methods previously developed by Read, Wormald, Palmer, and Robinson.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinson,