Abstract
A graph semigroup refers to a monoid whose defining relations are of the form xixj=xjxi. We describe the centralizer of an arbitrary element of a graph semigroup, show that there exists a unique factorization of any element into commuting parts, and prove related results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Reference
Cartier, P. and D. Foata,Problems Combinatoire de Commutation et Rearrangements, Lecture Notes in Math., No. 85, Springer-Verlag, Berlin, 1969.
Hall, M.,The Theory of Groups, Macmillan, New York, 1959.
Kim, K.H., L.G. Makar-Limanov, J. Neggers, and F.W. Roush,Graph algebra, Algebra,64 (1980), 46–51.
Author information
Authors and Affiliations
Additional information
Communicated by Boris M. Schein
Dedicated to L. M. Gluskin on the occasion of his sixtieth birthday
Rights and permissions
About this article
Cite this article
Kim, K.H., Makar-Limanov, L.G. & Roush, F.W. Graph monoids. Semigroup Forum 25, 1–7 (1982). https://doi.org/10.1007/BF02573584
Received:
Revised:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02573584