Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058932
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058932 Number of unlabeled claw-free cubic graphs with 2n nodes and connectivity 1. +0
1
0, 0, 0, 0, 0, 0, 1, 1, 3, 5, 11, 20 (list; graph; listen)
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

G.-B. Chae, Home page

CROSSREFS

Sequence in context: A118744 A092672 A061068 this_sequence A118037 A094588 A082713

Adjacent sequences: A058929 A058930 A058931 this_sequence A058933 A058934 A058935

KEYWORD

nonn

AUTHOR

njas, Jan 12 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research