A243783 Number of simple connected graphs on n nodes whose independence number a(g)=4.

0, 0, 0, 0, 1, 13, 205, 4308, 135563, 7161399

Offset

1,6

Comments

The independence number of a graph is the cardinality of the largest independent vertex set.

Links

Table of n, a(n) for n=1..10.

Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs

Travis Hoppe and Anna Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644 [math.CO], 2014.

Eric Weisstein's World of Mathematics, Independence Number, Maximum Independent Vertex Set

Crossrefs

Column 4 of A294490.

Cf. Values of a(g) for simple connected graphs, A243781, A243782, A243783, A243784.

Sequence in context: A299960 A194727 A059355 * A206348 A240393 A319115

Adjacent sequences: A243780 A243781 A243782 * A243784 A243785 A243786

Keyword

nonn,more,changed

Author

Travis Hoppe and Anna Petrone, Jun 20 2014

Status

approved