A058930 - OEIS

This site is supported by donations to The OEIS Foundation.

A058930

Number of 3-connected claw-free cubic graphs with 6n nodes.

0, 60, 19958400, 622452999168000, 258520167388849766400000, 675289572271869736778268672000000, 7393367369949286697176489031997849600000000 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	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 = 0..15` `G.-B. Chae, Home page`
	CROSSREFS	`Cf. A058931.` `Sequence in context: A003921 A003928 A065247 * A132096 A051322 A198189` `Adjacent sequences: A058927 A058928 A058929 * A058931 A058932 A058933`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2001`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 08:58 EST 2012. Contains 205614 sequences.