On graph products and multi-word-representability

Benny George Kenkireth, Gopalan Sajith, Sreyas Sasidharan

The multi-word-representation number $\hat{I}¼(G)$ is the minimum number of word-representable graphs whose union is $G$. We investigate $\hat{I}¼(H)$ for graph products $H$ obtained from $G_1…