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).
A019535
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).
Terms
- a(0) =8a(1) =13a(2) =22a(3) =33a(4) =58a(5) =127a(6) =145a(7) =262
External references
- oeis: A019535