Commuting graphs of inverse semigroups and completely regular semigroups
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866917079042490368 |
|---|---|
| author | Paulista, Tânia |
| author_facet | Paulista, Tânia |
| contents | The general ideal of this paper is to answer the following question: given a numerical property of commuting graphs, a class of semigroups $\mathcal{C}$ and $n\in\mathbb{N}$, is it possible to find a semigroup in $\mathcal{C}$ such that the chosen property is equal to $n$? We study this question for the classes of Clifford semigroups, inverse semigroups and completely regular semigroups. Moreover, the properties of commuting graphs we consider are the girth, clique number, chromatic number and knit degree. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_10612 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Commuting graphs of inverse semigroups and completely regular semigroups Paulista, Tânia Group Theory Combinatorics Rings and Algebras 05C25, 20M17, 20M18 (Primary), 05C15, 05C38, 05C69 (Secondary) The general ideal of this paper is to answer the following question: given a numerical property of commuting graphs, a class of semigroups $\mathcal{C}$ and $n\in\mathbb{N}$, is it possible to find a semigroup in $\mathcal{C}$ such that the chosen property is equal to $n$? We study this question for the classes of Clifford semigroups, inverse semigroups and completely regular semigroups. Moreover, the properties of commuting graphs we consider are the girth, clique number, chromatic number and knit degree. |
| title | Commuting graphs of inverse semigroups and completely regular semigroups |
| topic | Group Theory Combinatorics Rings and Algebras 05C25, 20M17, 20M18 (Primary), 05C15, 05C38, 05C69 (Secondary) |
| url | https://arxiv.org/abs/2511.10612 |