On the connectivity and equality of some graphs on finite semigroups

From MaRDI portal
Publication:2107133





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.



Cites work









This page was built for publication: On the connectivity and equality of some graphs on finite semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107133)