A290814 Number of non-word-representable connected graphs on n vertices.

0, 0, 0, 0, 0, 1, 25, 929, 54957, 4880093, 650856040

Offset

1,7

Comments

A simple graph G=(V,E) is word-representable if there exists a word w over the alphabet V such that letters x and y alternate in w iff xy is an edge in E. Word-representable graphs generalize several important classes of graphs. - Sergey Kitaev, Sep 19 2018

Links

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

Ozgur Akgun, Ian P. Gent, Sergey Kitaev, Hans Zantema, Solving computational problems in the theory of word-representable graphs, arXiv:1808.01215 [math.CO], 2018.

Sergey Kitaev, A comprehensive introduction to the theory of word-representable graphs, arXiv:1705.05924 [math.CO], 2017.

Example

The wheel graph W_5 is the only connected graph on 6 vertices that is not word-representable.

Crossrefs

Sequence in context: A264006 A218203 A319492 * A218230 A219060 A218316

Adjacent sequences: A290811 A290812 A290813 * A290815 A290816 A290817

Keyword

nonn,more

Author

Eric Rowland, Aug 11 2017

Extensions

a(11) from Sergey Kitaev, Sep 19 2018

a(9) corrected by Sergey Kitaev, Sep 20 2018

Status

approved