

A319491


Number of minimal nonwordrepresentable connected graphs on n vertices.


0




OFFSET

5,3


COMMENTS

A simple graph G=(V,E) is wordrepresentable 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. Wordrepresentable graphs generalize several important classes of graphs.


LINKS

Table of n, a(n) for n=5..9.
Ozgur Akgun, Ian P. Gent, Sergey Kitaev, Hans Zantema, Solving computational problems in the theory of wordrepresentable graphs, arXiv:1808.01215 [math.CO], 2018.
Sergey Kitaev, A comprehensive introduction to the theory of wordrepresentable graphs, arXiv:1705.05924 [math.CO], 2017.


EXAMPLE

The wheel graph W_5 is the only minimal connected graph on 6 vertices that is not wordrepresentable.


CROSSREFS

All nonwordrepresentable connected graphs are in A290814.
Sequence in context: A281767 A323799 A213575 * A034443 A304626 A121075
Adjacent sequences: A319488 A319489 A319490 * A319492 A319493 A319494


KEYWORD

nonn,more


AUTHOR

Sergey Kitaev, Sep 20 2018


STATUS

approved



