|
%I #7 Mar 30 2012 16:52:08
%S 1,1,2,1,2,2,4,3,13
%N Number of connected non-isomorphic well-covered circulant graphs on n nodes (excluding the complete graph).
%D Brown, Jason; and Hoshino, Richard; Well-covered circulant graphs. Discrete Math. 311 (2011), no. 4, 244-251.
%Y Cf. A204597.
%K nonn,more
%O 4,3
%A _N. J. A. Sloane_, Jan 17 2012
|
