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

0, 0, 0, 0, 0, 1, 19, 513, 21782, 1576634

Offset

1,7

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

T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014

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

Crossrefs

Column 5 of A294490.

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

Sequence in context: A348321 A284220 A201711 * A158583 A009081 A057644

Adjacent sequences: A243781 A243782 A243783 * A243785 A243786 A243787

Keyword

nonn,more

Author

Travis Hoppe and Anna Petrone, Jun 20 2014

Status

approved