|
Search: id:A058931
|
|
|
| A058931 |
|
Number of 3-connected claw-free cubic graphs with 2n nodes. |
|
+0
3
|
|
| 0, 1, 60, 0, 0, 19958400, 0, 0, 622452999168000, 0, 0, 258520167388849766400000, 0, 0, 675289572271869736778268672000000, 0, 0, 7393367369949286697176489031997849600000000, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
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
|
See A058930 for many more terms.
Sequence in context: A094489 A093403 A087535 this_sequence A092914 A022083 A016532
Adjacent sequences: A058928 A058929 A058930 this_sequence A058932 A058933 A058934
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2001
|
|
|
Search completed in 0.002 seconds
|
