A222626 - OEIS

A222626

Number of simple well-covered graphs on n nodes.

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

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

OFFSET

1,2

COMMENTS

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

LINKS

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).

KEYWORD

nonn,more

AUTHOR

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