Commuting graphs of boundedly generated semigroups

DOI10.1016/J.EJC.2016.02.009MaRDI QIDQ281929zbMATH OpenOpenAlexFDO

Authors Tomer Bauer, Be'eri Greenfeld

Publication date 11 May 2016

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1710.05250

zbMATH Keywords

knit degreestar-free graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

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.

Recommendations

• Minimal paths in the commuting graphs of semigroups
• Realizability problem for commuting graphs
• Commuting graphs of matrices over semirings.
• The commuting graph of the symmetric inverse semigroup
• On the structure of the commuting graph of Brandt semigroups

Cites work

• Minimal paths in the commuting graphs of semigroups
• Non-commuting graph of a group.
• On commuting graphs of semisimple rings
• On finite homomorphic images of the multiplicative group of a division algebra
• The diameters of commuting graphs of linear groups and matrix rings over the integers modulo \(m\)

Cited in

(5)

• On the connectivity and equality of some graphs on finite semigroups
• Minimal paths in the commuting graphs of semigroups
• The commuting graph of the symmetric inverse semigroup
• On the structure of the commuting graph of Brandt semigroups
• Realizability problem for commuting graphs

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)