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

0, 0, 0, 1, 8, 63, 524, 5863, 100702, 2880002

Offset

1,5

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

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

Sequence in context: A395831 A387841 A390821 * A369810 A105219 A060071

Adjacent sequences: A243779 A243780 A243781 * A243783 A243784 A243785

Keyword

nonn,more

Author

Travis Hoppe and Anna Petrone, Jun 20 2014

Status

approved