2-uniform words: cycle graphs, and an algorithm to verify specific word-representations of graphs

Ameya Daigavane, Mrityunjay Singh, Benny K. George

For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a,b)$ is in $E$ iff the letters $a$ and $b$ alternat…