%I #14 Feb 26 2025 02:40:26

%S 0,0,0,0,0,1,19,513,21782,1576634

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

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

%H Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>

%H Travis Hoppe and Anna Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependenceNumber.html">Independence Number</a>, <a href="https://mathworld.wolfram.com/MaximumIndependentVertexSet.html">Maximum Independent Vertex Set</a>

%Y Column 5 of A294490.

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

%K nonn,more,changed

%O 1,7

%A _Travis Hoppe_ and _Anna Petrone_, Jun 20 2014