Abstract
Word-representable graphs were introduced in 2008 by Kitaev and Pyatkin in the context of semigroup theory. Graphs are called word-representable if there exists a word with the graph’s nodes as letters such that the letters in the word alternate iff there is an edge between them in the graph. Until today numerous works investigated the word-representability of graphs but mostly from the graph perspective. In this work, we change the perspective to the words, i.e., we take classes of words and investigate the represented graphs. Our first subject of interest are the conjugates of words: we determine exactly which graphs are represented if we rotate the word. Afterwards, we look at k-local words introduced by Day et al. in 2017 in order to gain more insights into this class of words. Here, we investigate especially which graphs are represented by 1-local words. Lastly, we prove that the language of all words representing a graph is regular. We were also able to characterise k-representable graphs, solving an open problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chandrasekaran, S., Sulthana, A.: k-Power domination of crown graph. IJAER 14(13), 3066–3068 (2019)
Cheon, G.-S., Kim, J., Kim, M., Kitaev, S., Pyatkin, A.: On k-11-representable graphs. J. Comb. 10(3) (2019)
Choi, I., Kim, J., Kim, M.: On operations preserving semi-transitive orientability of graphs. J. Comb. Optim. 37(4), 1351–1366 (2018)
Collins, A., Kitaev, S., Lozin, V.V.: New results on word-representable graphs. Discret. Appl. Math. 216, 136–141 (2017)
Day, J.D., Fleischmann, P., Manea, F., Nowotka, D.: Local patterns. In: FSTTCS. LIPIcs, vol. 93, pp. 24:1–24:14 (2017)
Enright, J.A., Kitaev, S.: Polygon-circle and word-representable graphs. Electron. Notes Discret. Math. 71, 3–8 (2019)
Fleischmann, P., Haschke, L., Manea, F., Nowotka, D., Tsida, C.T., Wiedenbeck, J.: Blocksequences of k-local words. In: Bureš, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 119–134. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-67731-2_9
Gaetz, M., Ji, C.: Enumeration and extensions of word-representants. Discret. Appl. Math. 284, 423–433 (2020)
Glen, M.E.: Colourability and word-representability of near-triangulations. abs/1605.01688 (2018)
Halldórsson, M.M., Kitaev, S., Pyatkin, A.: On representable graphs, semi-transitive orientations, and the representation numbers. CoRR, abs/0810.0310 (2008)
Halldórsson, M.M., Kitaev, S., Pyatkin, A.: Graphs capturing alternations in words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 436–437. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14455-4_41
Jones, M.E., Kitaev, S., Pyatkin, A.V., Remmel, J.B.: Representing graphs via pattern avoiding words. Electron. J. Comb. 22(2), 2 (2015)
Kenkireth, B.G., Malhotra, A.S.: On word-representable and multi-word-representable graphs. In: Drewes, F., Volkov, M. (eds.) DLT 2023. LNCS, vol. 13911, pp. 156–167. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-33264-7_13
Kitaev, S.: A comprehensive introduction to the theory of word-representable graphs. In: Charlier, É., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 36–67. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62809-7_2
Kitaev, S.: Existence of \(u\)-representation of graphs. J. Graph Theory 85(3), 661–668 (2017)
Kitaev, S., Lozin, V.V.: Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series (2015)
Kitaev, S., Pyatkin, A.: On semi-transitive orientability of split graphs. CoRR, abs/2110.08834 (2021)
Kitaev, S., Pyatkin, A.V.: On representable graphs. J. Autom. Lang. Comb. 13(1), 45–54 (2008)
Kitaev, S., Seif, S.: Word problem of the Perkins semigroup via directed acyclic graphs. Order 25(3), 177–194 (2008)
Lothaire, M.: Combinatorics on Words. Cambridge Mathematical Library (1997)
Lyndon, R.C.: On Burnside’s problem. Trans. Am. Math. Soc. 77(2), 202–215 (1954)
Oliveros, D., Torres, A.: From word-representable graphs to altered Tverberg-type theorems. CoRR, abs/2111.10038 (2021)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Fleischmann, P., Haschke, L., Löck, T., Nowotka, D. (2024). Word-Representable Graphs from a Word’s Perspective. In: Fernau, H., Gaspers, S., Klasing, R. (eds) SOFSEM 2024: Theory and Practice of Computer Science. SOFSEM 2024. Lecture Notes in Computer Science, vol 14519. Springer, Cham. https://doi.org/10.1007/978-3-031-52113-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-031-52113-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-52112-6
Online ISBN: 978-3-031-52113-3
eBook Packages: Computer ScienceComputer Science (R0)