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

0, 1, 10, 47, 179

Offset: 5

Author

Sergey Kitaev, Sep 20 2018

Keywords

• nonn
• more

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.

Examples

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

Links

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

Crossrefs

All non-word-representable connected graphs are in A290814.