|
Search: id:A057848
|
|
|
| A057848 |
|
Number of 1-connected claw-free cubic graphs with 2n nodes. |
|
+0
3
|
|
| 0, 1, 60, 2520, 453600, 59875200, 13621608000, 8009505504000, 3123380227968000, 1832279324908032000, 2054813830468439040000, 1665031453088810526720000, 1925086583971531588608000000
(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..30
G.-B. Chae, Home page
|
|
CROSSREFS
|
Adjacent sequences: A057845 A057846 A057847 this_sequence A057849 A057850 A057851
Sequence in context: A062263 A075917 A058929 this_sequence A082670 A084659 A004297
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jan 12 2001
|
|
|
Search completed in 0.002 seconds
|
