|
|
A319491
|
|
Number of minimal non-word-representable connected graphs on n vertices.
|
|
0
|
|
|
|
OFFSET
|
5,3
|
|
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.
|
|
LINKS
|
|
|
EXAMPLE
|
The wheel graph W_5 is the only minimal connected graph on 6 vertices that is not word-representable.
|
|
CROSSREFS
|
All non-word-representable connected graphs are in A290814.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|