login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; 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.

LINKS

Table of n, a(n) for n=1..12.

G.-B. Chae, Home page

G.-B. Chae, Counting labeled claw-free cubic graphs by connectivity, Discrete Mathematics 308 (2008) 5136-5143.

G.-B. Chae, E. M. Palmer and R. W. Robinson, Computing the number of Claw-free Cubic Graphs with given Connectivity, Preprint, 2000. (Annotated scanned copy)

CROSSREFS

Sequence in context: A061068 A263925 A328660 * A118037 A094588 A299027

Adjacent sequences:  A058929 A058930 A058931 * A058933 A058934 A058935

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Jan 12 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 02:45 EST 2020. Contains 338756 sequences. (Running on oeis4.)