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

1, 1, 2, 1, 2, 2, 4, 3, 13

Offset

4,3

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=4..12.

Crossrefs

Cf. A204597.

Sequence in context: A184199 A262346 A242560 * A324387 A163373 A117193

Adjacent sequences: A204593 A204594 A204595 * A204597 A204598 A204599

Keyword

nonn,more

Author

N. J. A. Sloane, Jan 17 2012

Status

approved