Commuting graphs of boundedly generated semigroups
From MaRDI portal
Publication:281929
DOI10.1016/J.EJC.2016.02.009zbMATH Open1335.05082arXiv1710.05250OpenAlexW2343405274MaRDI QIDQ281929FDOQ281929
Authors: Tomer Bauer, Be'eri Greenfeld
Publication date: 11 May 2016
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: Ara'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest modifications for some of the original problems, generalized to the context of families of semigroups with a bounded number of generators, and pose related problems. We construct monomial semigroups with a bounded number of generators, whose commuting graphs have an arbitrary clique number. In contrast to that, we show that the diameter of the commuting graphs of semigroups in a wider class (containing the class of nilpotent semigroups), is bounded by the minimal number of generators plus two. We also address a problem concerning knit degree.
Full work available at URL: https://arxiv.org/abs/1710.05250
Recommendations
Cites Work
Cited In (5)
This page was built for publication: Commuting graphs of boundedly generated semigroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281929)