A204597 Number of connected non-isomorphic well-covered circulant graphs on n nodes (including the complete graph).

1, 2, 2, 3, 2, 3, 3, 5, 4, 14

Offset

3,2

References

Brown, Jason; and Hoshino, Richard; Well-covered circulant graphs. Discrete Math. 311 (2011), no. 4, 244-251.

Links

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

Crossrefs

Cf. A204596.

Sequence in context: A057334 A375674 A048475 * A285734 A051698 A046773

Adjacent sequences: A204594 A204595 A204596 * A204598 A204599 A204600

Keyword

nonn,more

Author

N. J. A. Sloane, Jan 17 2012

Status

approved