Several general classes of Toeplitz graphs (Riordan graphs of Appell type) are word-representable, explicit constructions exist for non-representable Toeplitz graphs, and the first examples of infinite word-representable Riordan graphs are given.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Word-representability of Toeplitz graphs
Several general classes of Toeplitz graphs (Riordan graphs of Appell type) are word-representable, explicit constructions exist for non-representable Toeplitz graphs, and the first examples of infinite word-representable Riordan graphs are given.