A243781 - OEIS

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

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

LINKS

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.

CROSSREFS

Column 2 of A294490.

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

KEYWORD

nonn,more,changed

AUTHOR

STATUS

approved