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

0, 0, 1, 4, 11, 34, 103, 405, 1892, 12166

Offset

1,4

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 2 of A294490.

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

Sequence in context: A180305 A060925 A027045 * A227329 A006765 A151272

Adjacent sequences: A243778 A243779 A243780 * A243782 A243783 A243784

Keyword

nonn,more

Author

Travis Hoppe and Anna Petrone, Jun 20 2014

Status

approved