A287023 Number of simple disconnected weakly perfect graphs on n vertices.

0, 1, 2, 5, 13, 43, 186, 1187, 13006, 270900, 11286208

Offset

1,3

Comments

First differs from A287008 (number of simple disconnected graphs with equal chromatic and fractional chromatic number) at a(8).

Links

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

Eric Weisstein's World of Mathematics, Disconnected Graph

Eric Weisstein's World of Mathematics, Weakly Perfect Graph

Formula

a(n) = A198634(n) - A287009(n).

Crossrefs

Cf. A198634 (number of not necessarily connected simple weakly perfect graphs).

Cf. A287009 (number of not connected simple weakly perfect graphs).

Cf. A287008 (number of simple disconnected graphs with equal chromatic and fractional chromatic number).

Sequence in context: A212824 A338660 A286949 * A287008 A119533 A066740

Adjacent sequences: A287020 A287021 A287022 * A287024 A287025 A287026

Keyword

nonn,more

Author

Eric W. Weisstein, May 18 2017

Extensions

a(11) from formula by Falk Hüffner, Aug 13 2017

Status

approved