Abstract
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x ≠ y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1].
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
Kitaev, S., Pyatkin, A.: On representable graphs. Automata, Languages and Combinatorics 13(1), 45–54 (2008)
Kitaev, S., Seif, S.: Word problem of the Perkins semigroup via directed acyclic graphs. Order (2008), doi:10.1007/s11083-008-9083-7
Konovalov, A., Linton, S.: On word representations of the Petersen graph. CIRCA preprint 2010/8, University of St. Andrews (2010)
http://wwwteo.informatik.uni-rostock.de/isgci/smallgraphs.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Halldórsson, M.M., Kitaev, S., Pyatkin, A. (2010). Graphs Capturing Alternations in Words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds) Developments in Language Theory. DLT 2010. Lecture Notes in Computer Science, vol 6224. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14455-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-14455-4_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14454-7
Online ISBN: 978-3-642-14455-4
eBook Packages: Computer ScienceComputer Science (R0)