A222626 - OEIS

%I #23 Feb 16 2025 08:33:19

%S 1,2,3,7,14,46,164,996,10195,208168,8016530,542165050

%N Number of simple well-covered graphs on n nodes.

%C A graph is well-covered if its maximal independent vertex sets are of equal size.

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version a1db88e

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Well-CoveredGraph.html">Well-Covered Graph</a>

%F a(n) = A287025(n) + A222625(n).

%Y Cf. A222625 (number of connected well-covered graphs).

%Y Cf. A287025 (number of disconnected well-covered graph).

%K nonn,more,changed

%O 1,2

%A _Eric W. Weisstein_, Feb 26 2013

%E a(10) from _Eric W. Weisstein_, Aug 29 2013

%E a(11)-a(12) added using tinygraph by _Falk Hüffner_, Aug 15 2017