|
Search: id:A084656
|
|
|
| A084656 |
|
Number of unlabeled connected claw-free cubic graphs on 2n vertices. |
|
+0
1
|
|
| 0, 1, 1, 1, 1, 3, 3, 5, 11, 15, 27, 54, 94, 181, 369
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
A cubic graph is claw-free (contains no induced K_{1,3}) if and only if every vertex lies in a triangle. All graphs counted are simple (no loops or multiple edges).
|
|
LINKS
|
Gordon Royle, Combinatorial Data.
|
|
EXAMPLE
|
K_4 is claw-free and so a(2) = 1, while the triangular prism is the only claw-free cubic graph on 6 vertices, so a(3) = 1.
|
|
CROSSREFS
|
Cf. A084657, A084658, A057848.
Sequence in context: A072337 A132751 A032020 this_sequence A073749 A146918 A093306
Adjacent sequences: A084653 A084654 A084655 this_sequence A084657 A084658 A084659
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gordon Royle (gordon(AT)maths.uwa.edu.au), Jun 02 2003
|
|
|
Search completed in 0.002 seconds
|
