|
%I #12 Apr 02 2019 03:21:23
%S 8,13,22,33,58,127,145,262
%N Let I_c(n,d) be the maximal number of independent sets in d-regular simple connected graphs with n nodes; sequence gives I_c(n,6).
%D Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).
%H T. Sillke, <a href="http://www.mathematik.uni-bielefeld.de/~sillke/">For more info</a>
%Y Cf. A019533, A019534.
%K nonn,more
%O 7,1
%A _Achim Flammenkamp_
%E Degree corrected by _Sean A. Irvine_, Apr 01 2019
|
