login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #5 Mar 30 2012 16:52:08

%S 1,2,2,3,2,3,3,5,4,14

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

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

%Y Cf. A204596.

%K nonn,more

%O 3,2

%A _N. J. A. Sloane_, Jan 17 2012