|
| |
|
|
A058932
|
|
Number of unlabeled claw-free cubic graphs with 2n nodes and connectivity 1.
|
|
1
| |
|
|
0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 11, 20
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,9
|
|
|
REFERENCES
| G.-B. Chae (chaegabb(AT)pilot.msu.edu), E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, preprint, 2001.
G.-B. Chae, Counting labeled claw-free cubic graphs by connectivity, Discrete Mathematics 308 (2008) 5136-5143.
|
|
|
LINKS
| G.-B. Chae, Home page
|
|
|
CROSSREFS
| Sequence in context: A118744 A092672 A061068 * A118037 A094588 A082713
Adjacent sequences: A058929 A058930 A058931 * A058933 A058934 A058935
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2001
|
| |
|
|
