On the Enhanced Power Graph of a Semigroup
From MaRDI portal
Abstract: The enhanced power graph of a semigroup is a simple graph whose vertex set is and two vertices are adjacent if and only if for some , where is the subsemigroup generated by . In this paper, first we described the structure of for an arbitrary semigroup . Consequently, we discussed the connectedness of . Further, we characterized the semigroup such that is complete, bipartite, regular, tree and null graph, respectively. Also, we have investigated the planarity together with the minimum degree and independence number of . The chromatic number of a spanning subgraph, viz. the cyclic graph, of is proved to be countable. At the final part of this paper, we construct an example of a semigroup such that the chromatic number of need not be countable.
Recommendations
Cited in
(6)- On the clique number and independence number of the cyclic graph of a semigroup
- The number of spanning trees of E-extended power graphs associated with finite semigroups
- Power graphs of completely regular semigroups
- Green's graphs of a semigroup
- On the power graphs of semigroups of homogeneous elements of graded rings
- Domination parameters on Cayley digraphs of full transformation semigroups relative to Green's equivalence \(\mathcal{L}\)-classes and their complements
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)