On Patterns and Languages in 1-11-Representations of Graphs

Biswajit Das, Ramesh Hariharasubramanian

A 1-11-representation of a graph $G(V,E)$ is a word over the alphabet $V$ such that two distinct vertices $x$ and $y$ are adjacent if and only if the restricted word $wx,y$ (obta…