Representing split graphs by words

Chen, Herman Z.Q. and Kitaev, Sergey and Saito, Akira (2020) Representing split graphs by words. Discussiones Mathematicae Graph Theory. ISSN 1234-3099 (In Press)

[thumbnail of Chen-etal-DMGT-2020-Representing-split-graphs-by] Text (Chen-etal-DMGT-2020-Representing-split-graphs-by)
Accepted Author Manuscript
Restricted to Repository staff only until 17 June 2021.

Download (182kB) | Request a copy from the Strathclyde author


    There is a long line of research in the literature dedicated to word-representable graphs, which generalize several important classes of graphs. However, not much is known about word-representability of split graphs, another important class of graphs. In this paper, we show that threshold graphs, a subclass of split graphs, are word-representable. Further, we prove a number of general theorems on word-representable split graphs, and use them to characterize computationally such graphs with cliques of size 5 in terms of 9 forbidden subgraphs, thus extending the known characterization for word-representable split graphs with cliques of size 4. Moreover, we use split graphs, and also provide an alternative solution, to show that gluing two word-representable graphs in any clique of size at least 2 may, or may not, result in a word-representable graph. The two surprisingly simple solutions provided by us answer a question that was open for about ten years.

    ORCID iDs

    Chen, Herman Z.Q., Kitaev, Sergey ORCID logoORCID: and Saito, Akira;