On the Enhanced Power Graph of a Semigroup

From MaRDI portal
Publication:6202895




Abstract: The enhanced power graph mathcalPe(S) of a semigroup S is a simple graph whose vertex set is S and two vertices x,yinS are adjacent if and only if x,yinlanglezangle for some zinS, where langlezangle is the subsemigroup generated by z. In this paper, first we described the structure of mathcalPe(S) for an arbitrary semigroup S. Consequently, we discussed the connectedness of mathcalPe(S). Further, we characterized the semigroup S such that mathcalPe(S) is complete, bipartite, regular, tree and null graph, respectively. Also, we have investigated the planarity together with the minimum degree and independence number of mathcalPe(S). The chromatic number of a spanning subgraph, viz. the cyclic graph, of mathcalPe(S) is proved to be countable. At the final part of this paper, we construct an example of a semigroup S such that the chromatic number of mathcalPe(S) need not be countable.









This page was built for publication: On the Enhanced Power Graph of a Semigroup

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