A222626 Number of simple well-covered graphs on n nodes.

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

Offset

1,2

Comments

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

Links

Table of n, a(n) for n=1..12.

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version a1db88e

Eric Weisstein's World of Mathematics, Well-Covered Graph

Formula

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

Crossrefs

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

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

Sequence in context: A165433 A238728 A271718 * A006627 A077161 A068080

Adjacent sequences: A222623 A222624 A222625 * A222627 A222628 A222629

Keyword

nonn,more

Author

Eric W. Weisstein, Feb 26 2013

Extensions

a(10) from Eric W. Weisstein, Aug 29 2013

a(11)-a(12) added using tinygraph by Falk Hüffner, Aug 15 2017

Status

approved