|
|
A019534
|
|
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(2n,5).
|
|
2
|
|
|
|
OFFSET
|
3,1
|
|
REFERENCES
|
Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|