|
Search: id:A058929
|
|
|
| A058929 |
|
Number of 2-connected claw-free labeled cubic graphs with 2n nodes. |
|
+0
3
|
|
| 0, 1, 60, 2520, 453600, 59875200, 10897286400, 6701831136000, 2623194782208000, 1338096104497152000, 1633313557551836160000, 1324107982344764897280000, 1408369399403068118016000000
(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, Table of n, a(n) for n = 1..18
G.-B. Chae, Home page
|
|
CROSSREFS
|
Sequence in context: A130647 A062263 A075917 this_sequence A057848 A082670 A084659
Adjacent sequences: A058926 A058927 A058928 this_sequence A058930 A058931 A058932
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2001
|
|
|
Search completed in 0.002 seconds
|
