id:A019535 - OEIS Search Results

Search: id:A019535

Displaying 1-1 of 1 results found.

page 1

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,7).

+0
1

8, 13, 22, 33, 58, 127, 145, 262 (list; graph; listen)

	OFFSET	`7,1`
	REFERENCES	`Posting to math-fun(AT)cs.arizona.edu by Torsten Sillke (sillke(AT)lh-systems.de).`
	LINKS	`T. Sillke, For more info`
	CROSSREFS	`Sequence in context: A030782 A063849 A101642 this_sequence A093023 A057097 A096371` `Adjacent sequences: A019532 A019533 A019534 this_sequence A019536 A019537 A019538`
	KEYWORD	`nonn`
	AUTHOR	`Achim Flammenkamp (achim(AT)HRZ.Uni-Bielefeld.DE)`

page 1

Search completed in 0.002 seconds

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.