On the connectivity and equality of some graphs on finite semigroups (Q2107133)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the connectivity and equality of some graphs on finite semigroups |
scientific article; zbMATH DE number 7625540
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the connectivity and equality of some graphs on finite semigroups |
scientific article; zbMATH DE number 7625540 |
Statements
On the connectivity and equality of some graphs on finite semigroups (English)
0 references
1 December 2022
0 references
In this article, four families of graphs associated with semigroups are discussed, which are: the power graphs, the cyclic graphs, the enhanced power graphs, and the commuting graphs. In the first part of the article, only semigroups having one idempotent are considered, and in fact, the interconnection between the diameters of the graphs associated with such semigroups is investigated. Consequently, the results on the connectedness and the diameter of properly enhanced power graphs (or cyclic graphs) of finite groups, especially, symmetric groups, and alternating groups, are obtained. In the second part of this article, for an arbitrary pair of these four families, the finite semigroups are classified such that the related graphs coincide. The obtained results generalize some of the corresponding results of these graphs on groups to semigroups.
0 references
monogenic semigroup
0 references
power graph
0 references
cyclic graph
0 references
enhanced power graph
0 references
commuting graph
0 references
0 references
0 references