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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058931 Number of 3-connected claw-free cubic graphs with 2n nodes. 4
0, 1, 60, 0, 0, 19958400, 0, 0, 622452999168000, 0, 0, 258520167388849766400000, 0, 0, 675289572271869736778268672000000, 0, 0, 7393367369949286697176489031997849600000000, 0, 0 (list; graph; refs; listen; history; text; internal format)
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.

LINKS

G.-B. Chae, Table of n, a(n) for n = 1..47

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

See A058930 for many more terms.

Sequence in context: A188269 A093403 A087535 * A092914 A022083 A174675

Adjacent sequences:  A058928 A058929 A058930 * A058932 A058933 A058934

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jan 12 2001

EXTENSIONS

Added b-file, N. J. A. Sloane, Feb 08 2012

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 April 3 17:03 EDT 2020. Contains 333197 sequences. (Running on oeis4.)